Register
Filter

Recent activity by _Madhuri

0 answers
1
Self doubts
Large(n) { If(n<=1) Return n; Sum=0; For i=0 to n-1 Sum=Sum+Large(i); Return Sum; } What will be its time complexity??
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??
1 answer
2
My doubt
What will be the recurrence relation for max heapify. Please explain with example.
What will be the recurrence relation for max heapify. Please explain with example.
2 answers
3
Sorting(Algorithms)
The complexity of comparison based sorting algorithm is (nlogn) .How?
The complexity of comparison based sorting algorithm is (nlogn) .How?