heaps fig after the third pass of phase ii fig after the fourth and final pass of phase ii analysis of phase ii the work of phase ii is in the calls to the __siftdownfromto method which is called times each call must sift down an element in tree that shrinks by one element each time earlier in this we did the analysis to determine that the amount of work in the average and worst case is proportional to log ( th (nlogni= the best case of phase ii would require that all values in the heap are identical in that case the computational complexity would be (nsince the values would never this copy belongs to 'acha