Abstract
The performance of Heapsort algorithms on arbitrary input is examined. It is proved that ann logn−O(n) lower bound on the number of comparisons holds for a set of Heapsort algorithms, including Williams-Floyd's algorithm, Carlsson's bottom-up linear or binary insertion algorithm, and all up-down algorithms, on any input.
Zusammenfassung
Dieser Artikel untersucht die Komplexität von Heapsort Algorithmen für willkürliche Eingaben. Es wird bewiesen, daß für die Anzahl der Vergleiche auf jeden Fall eine untere Schranke vom Typ nlogn-O(n) gilt, und zwar in einr Klasse von Heapsort Algorithmen, die den Williams-Floyd-Algorithmus, den Carlsson-Algorithmus mit linearem oder binärem Einfügen und alle up-down Algorithmen enthält.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
[Ca87a] Carlsson, S.: Average-case results on heapsort. BIT27, 2 (1987).
[Ca87b] Carlsson, S.: A variant of heapsort with almost optimal number of comparisons. Information Processing Letters24, 4 (1987).
[Ca91] Carlsson, S.: An optimal algorithm for deleting the root of a heap. Information Processing Letters37, 2 (1991).
[Do84] Doberkat, E.: An average case analysis of Floyd's algorithm to construct heaps. Information and Control61, 2 (1984).
[DW91] Ding, Y., Weiss, M.: On heapsort algorithms that are good in both worst-case and averagecase, Tech. Report, School of Computer Science, Florida International University, Feb. 1991.
[Fl64] Floyd, R.: Algorithm 245: Treesort. Comm. ACM7, 12 (1964).
[Fr88] Frieze, A.: On the random construction of heaps. Information Processing Letters27, 2 (1988).
[FSU91] Fleischer, R., Sinha, B., Uhrig, C.: A lower bound for the worst case of bottom-up-heapsort, personal communication, Jan. 1991.
[GM86] Gonnet, G., Munro, J.: Heaps on heaps. SIAM J. Comput.15 4 (1986).
[Ha91] Hayward, R.: Average case analysis of heap building by repeated insertion. J. Algorithms12, 1 (1991).
[Kn73] Knuth, D.: The art of computer programming, Vol. 3. Reading, MA: Addison-Wesley 1973.
[MR89] McDiarmid, C., Reed, B.: Building heaps fast. J. Algorithms10, 3 (1989).
[PS75] Porter, T., Simon, I.: Random insertion into a priority queue structure. IEEE Trans. Software EngineeringSE-1, 3 (1975).
[We90] Wegener, I.: Bottom-up-heapsort, a new variant of heapsort beating on avergage quicksort (ifn is not very small). Berlin, Heidelberg, New York: Springer 1990 (MFCS'90, Lecture Notes in Computer Science 452).
[Wi64] Williams, J.: Algorithm 232: Heapsort. Comm. ACM7, 6 (1964).
[XY90] Xunrang, G., Yuzhang, Z.: A new heapsort algorithm and the analysis of its complexity. The Computer Journal33, 3 (1990).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ding, Y., Weiss, M.A. Best case lower bounds for Heapsort. Computing 49, 1–9 (1992). https://doi.org/10.1007/BF02238646
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02238646