
#1
May2308, 07:23 AM

P: 55

Hello,
I don't understand the proof of best case for Make Heap algorithm. The Algorithm is:
t(n) <= 2*2[tex]^{0}[/tex] + 2*2[tex]^{1}[/tex] + ... + 2*2[tex]^{k2}[/tex] so why not until 2[tex]^{k1}[/tex], in Make_Heap procedure it iterates till the root ? and why every term is multiplied by 2 ? Thank You 


Register to reply 
Related Discussions  
Heap Pumps, Electrical Energy  General Physics  21  
The shape of a heap of sand turns flat after being kicked...  Quantum Physics  0  
Irritating heap corruption error in VC++2005  Programming & Computer Science  0  
Learn the general case first, or the special case first?  General Math  6  
The Sorites heap paradox  General Discussion  8 