Skip to main content
SpringerLink
Log in

Bottom-up-heap sort, a new variant of heap sort beating on average quick sort (if n is not very small)

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1990 (MFCS 1990)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 452))

Abstract

A new variant of HEAP SORT, called BOTTOM-UP-HEAP SORT, is presented. This new sequential sorting algorithm is easy to implement and beats QUICK SORT on average, if n ≥ 400, and the best-off-three version of QUICK SORT, if n ≥ 16000. The worst case number of comparisons can be bounded by 1.5n log n + O(n).

Extended Abstract

Supported in part by DFG grants We 1066/2-1 and Me 872/1-2

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Carlsson, S. (1987a). A variant of HEAP SORT with almost optimal number of comparisons. Information Processing Letters 25, 247–250.

    Google Scholar 

  • Carlsson, S. (1987b). Average-case results on HEAP SORT. BIT 27, 2–17.

    Google Scholar 

  • Doberkat, E.E. (1982). Deleting the root of a heap. Acta Informatica 17, 245–265.

    Google Scholar 

  • Doberkat, E.E. (1984). An average case analysis of Floyd's algorithm to construct heaps. Information and Control 61, 114–131.

    Google Scholar 

  • Floyd, R.W. (1964). Algorithm 245, treesort 3. Communication of the ACM 7, 701.

    Google Scholar 

  • Hoare, C.A.R. (1962). Quicksort. Computer Journal 5, 10–15.

    Google Scholar 

  • Kemp,R. (1989). Pers. communication.

    Google Scholar 

  • McDiarmid, C.J.H. and Reed, B.A. (1989). Building heaps fast. Journal of Algorithms 10, 352–365.

    Google Scholar 

  • Wegener,I. (1989). Complete version of this paper. Preprint.

    Google Scholar 

  • Wegener,I. (1990). The worst case complexity of McDiarmid and Reed's variant of BOTTOM-UP-HEAP SORT is less than n log n + 1.1n. Preprint.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. FB Informatik, LS II, Univ. Dortmund, Postfach 500 500, 4600, Dortmund 50, Fed. Rep. of Germany

    Ingo Wegener

Authors
  1. Ingo Wegener
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Branislav Rovan

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wegener, I. (1990). Bottom-up-heap sort, a new variant of heap sort beating on average quick sort (if n is not very small). In: Rovan, B. (eds) Mathematical Foundations of Computer Science 1990. MFCS 1990. Lecture Notes in Computer Science, vol 452. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029650

Download citation

  • DOI: https://doi.org/10.1007/BFb0029650

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52953-8

  • Online ISBN: 978-3-540-47185-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation