Skip to main content
SpringerLink
Log in

The worst case complexity of MC Diarmid and Reed's variant of BOTTOM-UP-HEAT SORT is less than n log n+1.1n

  • Algorithms I
  • Conference paper
  • First Online:
STACS 91 (STACS 1991)

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

Included in the following conference series:

Abstract

BOTTOM-UP-HEAP SORT is a variant of HEAP SORT which beats on average even the clever variants of QUICK SORT, if n is not very small. Up to now, the worst case complexity of BOTTOM-UP-HEAP SORT can be estimated only by 1.5n log n. McDiarmid and Reed (1989) have presented a variant of BOTTOM-UP-HEAP SORT which needs extra storage for n bits. The worst case number of comparisons of this (almost internal) sorting algorithm is estimated by n log n+1.1n. It is discussed how many comparisons can be saved on average.

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

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 HEAPSORT with almost optimal number of comparisons. Information Processing Letters 24, 247–250.

    Article  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Wegener, I. (1990). BOTTOM-UP-HEAPSORT, a new variant of HEAPSORT beating on average QUICKSORT (if n is not very small). MFCS '90, Lecture Notes in Computer Science 452, 516–522.

    Google Scholar 

  • Williams, J.W.J. (1964). Algorithm 232. Communication of the ACM 7, 347–348.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. FB Informatik, LS II, Universität 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

Christian Choffrut Matthias Jantzen

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wegener, I. (1991). The worst case complexity of MC Diarmid and Reed's variant of BOTTOM-UP-HEAT SORT is less than n log n+1.1n. In: Choffrut, C., Jantzen, M. (eds) STACS 91. STACS 1991. Lecture Notes in Computer Science, vol 480. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0020794

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53709-0

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation