MCQOPTIONS
Saved Bookmarks
| 1. |
Consider the following C function. int fun1 (int n) { int i, j, k, p, q = 0; for (i = 1; i1; j=j/2) ++p; for (k=1; k |
| A. | n3 |
| B. | n (logn)2 |
| C. | nlogn |
| D. | nlog(logn) |
| Answer» E. | |