456 views

Please log in or register to answer this question.

Position:
Show:

Related questions

3 3 votes
1 1 answer
2.5k
2.5k views
Pooja Palod asked Dec 5, 2015
2,513 views
Although merge sort runs in Θ(n lg n) worst-case time, and insertion sort runs in Θ(n 2 ) worst-case time, the constant factors in insertion sort make it fast...
0 0 votes
0 0 answers
1.2k
1.2k views
Pawan Nirpal asked Oct 29, 2021
1,232 views
Operator precedence rule for prefix and postfix ++For C programming is the above mentioned article considered as standard, Is there any standard compiler or C standard th...
2 2 votes
1 1 answer
1.1k
1.1k views
Venkat Sai asked Jan 17, 2018
1,120 views
#include <stdio.h>int yellow();int main(){ int hello(); yellow(); printf("%d",hello()); return 0;}int yellow(){ hello(); }int hello(){printf("hello hello...
5 5 votes
1 1 answer
2.7k
2.7k views
Tuhin Dutta asked Nov 14, 2017
2,656 views
#include <stdio.h>int main(){ int check = 20; const int arr[] = {10, 20, 30}; switch (check) { case arr[0]: printf("Tuhin "); case arr : printf...