Heap Building Bounds
We consider the lower bound for building a heap in the worst case and the upper bound in the average case. We will prove that the supposedly fastest algorithm in the average case does not attain its claimed bound and indeed is slower than that in . We will then prove that the adversarial argument for the claimed best lower bound in the worst case is also incorrect and the adversarial argument used yields a bound which is worse than that in  given by an information theory argument. Finally, we have proven a lower bound of 1.37n + o(n) for building a heap in the worst case.
KeywordsFast Algorithm Average Case Left Child Binomial Tree Extra Element
Unable to display preview. Download preview PDF.
- 1.Carlsson, S., Chen, J.: The complexity of heaps. In: Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms, pp. 393–402. SIAM, Philadelphia (1992)Google Scholar
- 3.Cormen, T.H., Leiserson, C.E., Rivest, R.L., Sten, C.: Introduction to Algorithms, 2nd edn. The MIT Press, McGraw-Hill Book Company (2001)Google Scholar
- 7.Williams, J.W.J.: Algorithm 232: Heapsort. Commun. of the ACM 7(6), 347–348 (1964)Google Scholar