713 views
1 1 vote

Please log in or register to answer this question.

Position:
Show:

Related questions

0 0 votes
1 1 answer
1.3k
1.3k views
LavTheRawkstar asked Jan 12, 2017
1,314 views
INSERTION-SORT (A, n) ⊳ A[1 . . n]for (j ← 2 to len(A) ){key ← A[ j];i ← j – 1 ; while (i 0 and A[i] key) { A[i+1] ← A[i...
1 1 vote
1 1 answer
2.5k
2.5k views
Akriti sood asked Dec 22, 2016
2,460 views
What is the worst case time complexity of the following recurrence relation?T(n)=T(n/2)+T(n/4)+T(n/8)+n Θ(nlogn) Θ(n2) Θ(n) -i am solving like thisT(n) <...
2 2 votes
2 answers 2 answers
3.5k
3.5k views
Amar Vashishth asked Aug 2, 2015
3,528 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; }
2 2 votes
2 2 answers
2.5k
2.5k views
Vikrant Singh asked Jan 31, 2015
2,471 views
What is the worst case time complexity to find the gcd(m,n) using best algorithm known?A. O(log(min(m,n)))B, O(log(max(m,n)))