0 votes
0 answers
1
Large(n){If(n<=1)Return n; Sum=0;For i=0 to n-1Sum=Sum+Large(i);Return Sum; }What will be its time complexity??
0 votes
1 answer
2
What will be the recurrence relation for max heapify. Please explain with example.
0 votes
2 answers
3
The complexity of comparison based sorting algorithm is (nlogn) .How?