retagged by
785 views

1 Answer

Best answer
1 votes
1 votes
it is B. O(n)....
selected by

Related questions

1 votes
1 votes
3 answers
3
khushboo123 asked May 25, 2016
1,028 views
int fun(int n){ int count = 0; for (int i = n; i 0; i /= 2) for (int j = 0; j < i; j++) count += 1; return count; }then this function should give O(nlogn).since outer lo...
0 votes
0 votes
0 answers
4
Akriti sood asked Dec 27, 2016
358 views
in an effort to make MERGE-SORT faster, you decide to divide the array into k equal sized, disjoint subarrays, where k 2. This means that you have to merge k lists. How ...