Minheap

Question

Comments

@prajwal
for 1st min----------------------- 0 comparison
for 2nd min------------------------1 comparison
.
.
for 100th min----------------------99 comp
so total 99*50=4950 comparison for 100th min .... nd 1 mor thing it is nt a function of n.

---

@saurabh rai I got your approach.Thnx 

---

^to get more go through https://gateoverflow.in/1110/gate2003-23

Answer 1

you can extract the min everytime from min heap at the 100Th time the 100th smallest will come out and again to maintain the heapify property it will be O(logn) so 100 times O(100*logn)

so answer will be $\Theta (\log n)$

Comments

i think you are reffering this https://gateoverflow.in/1110/gate2003_23

---

yeah....

---

the last line i think $\theta (logn)$ is only correct