Abstract
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[2] does not attain its claimed bound and indeed is slower than that in [6]. We will then prove that the adversarial argument for the claimed best lower bound in the worst case[1] is also incorrect and the adversarial argument used yields a bound which is worse than that in [5] 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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
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)
Carlsson, S., Chen, J.: Heap construction: Optimal in both worst and average cases? In: Algorithms and Computation, pp. 254–263. Springer, Heidelberg (1995)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Sten, C.: Introduction to Algorithms, 2nd edn. The MIT Press, McGraw-Hill Book Company (2001)
Floyd, R.W.: Algorithm 245: Treesort. Commun. ACM 7(12), 701 (1964)
Gonnet, G.H., Munro, I.: Heaps on heaps. SIAM Journal of Computing 15(4), 964–971 (1986)
McDiarmid, C.J., Reed, B.A.: Building heaps fast. J. Algorithms 10(3), 352–365 (1989)
Williams, J.W.J.: Algorithm 232: Heapsort. Commun. of the ACM 7(6), 347–348 (1964)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, Z., Reed, B.A. (2005). Heap Building Bounds. In: Dehne, F., López-Ortiz, A., Sack, JR. (eds) Algorithms and Data Structures. WADS 2005. Lecture Notes in Computer Science, vol 3608. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11534273_3
Download citation
DOI: https://doi.org/10.1007/11534273_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28101-6
Online ISBN: 978-3-540-31711-1
eBook Packages: Computer ScienceComputer Science (R0)