Heap Sorting II
Remove()
val=HeapArray[1];
HeapArray[1]=HeapArray[NumElements];
NumElements--;
int k=1; int newK;
while (2*k <= NumElements){
if (Compare(2*k, 2*k+1)) < 0) newK=2*k; else newK=2*k+1;
if (Compare(k, newK) ɘ) break;
Exchange(k,newK);
k=newK;}
return val;}
Previous slide
Next slide
Back to first slide
View graphic version