b) Compute the time complexity of the following codes using Big-O notation: void main() { int i=1, j%31, n; scanf("%d", &n); #include ii void main() { int i, j, n; scanf("%d", &n): while(i=1; /=2)...

ii void main() { int i, j, n; scanf("%d", &n): while(i<=n) {="" for(1="n;" i="">=1; /=2) for(j=n/2; j>=1; j-) printf"Leading University\n"); printf("LU, CSE\n"); i+=2; } do { printf("It is not complex. \n"); i*=2; for(i=1; i*i<=n; i++)="" printf("department="" of="" cse.="" n");="" }="" while=""><=n); c)="" why="" we="" prefer="" worst="" case="" complexity="" than="" others?="" share="" valid="" reasons.="" "/="">
Extracted text: b) Compute the time complexity of the following codes using Big-O notation: void main() { int i=1, j%31, n; scanf("%d", &n); #include ii void main() { int i, j, n; scanf("%d", &n): while(i<=n) {="" for(1="n;" i="">=1; /=2) for(j=n/2; j>=1; j-) printf"Leading University\n"); printf("LU, CSE\n"); i+=2; } do { printf("It is not complex. \n"); i*=2; for(i=1; i*i<=n; i++)="" printf("department="" of="" cse.="" n");="" }="" while=""><=n); c)="" why="" we="" prefer="" worst="" case="" complexity="" than="" others?="" share="" valid="">