Algorithm Question

Question

Comments

this link doesn't open any question. please check the link.

---

ohh that's because one has to attempt that test to access the question :|

---

Build heap : O(n)

Ex :To find 2nd minimum Delete root 2 times - 2*log(n)

To find rth minimum  - r*log(n)

Total complexity: O(n + r*log(n)) = O(n)

(since r<n and some constant therefore n is asymptotically larger than r*log(n) )

Answer 1

the ans is o(nlogr)  because ....

first we build a heap and then one by one we get logr times required to call and balance it