Skip to main content
SpringerLink
Log in

Bottom-up mergesort — A detailed analysis

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

Though the behaviors of mergesort algorithms are basically known, the periodicity phenomena encountered in their analyses are not easy to deal with. In this paper closed-form expressions for the necessary number of comparisons are derived for the bottom-up algorithm, which adequately describe its periodic behavior. This allows us, among other things, to compare the top-down and bottom-up mergesort algorithms.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Chéno, L. Profils limites d'histoires sur les dictionnaires et les files de priorité; Application aux files binomiales, Thèse, Université de Paris-Sud, 1981.

  2. Delange, H. Sur las fonction sommatoire de la fonction “Somme des Chiffres”.Enseign. Math. (2),21 (1975), 31–47.

    Google Scholar 

  3. Flajolet, P., and Golin, M. Mellin transforms and asymptotics: the mergesort recurrence.Acta Inform.,31 (1994), 673–696.

    Google Scholar 

  4. Flajolet, P., Grabner, P., Kirschenhofer, P., Prodinger, H., and Tichy, R. F. Mellin transforms and asymptotics: digital sums.Theoret. Compul. Sci.,123 (1994), 291–314.

    Google Scholar 

  5. Foster, D. M. Estimates for a remainder term associated with the sum of digits function.Glasgow Math. J.,29 (1987), 109–129.

    Google Scholar 

  6. Golin, M., and Sedgewick, R. Queue-mergesort.Inform. Process. Lett.,48 (1993), 253–259.

    Google Scholar 

  7. Gonnet, G. H., and Baeza-Yates, R.Handbook of Algorithms and Data Structures, 2nd edn. Addison-Wesley, Reading, MA, 1991.

    Google Scholar 

  8. Knuth, D. E.The Art of Computer Programming: Sorting and Searching. Addison-Wesley, Reading, MA, 1973.

    Google Scholar 

  9. Panny, W. Straight two-way mergesort: der Algorithmus und seine Analyse, inStatistik, Informatik und Ökonomie-Josef Roppert zum 60. Geburtstag (W. H. Janko, ed). Springer-Verlag, Berlin, 1988, pp. 216–236.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Economics, Augasse 2-6, A-1090, Vienna, Austria

    W. Panny

  2. Department of Algebra and Discrete Mathematics, Technical University, Wiedner Hauptstrasse 8-10, A-1040, Vienna, Austria

    H. Prodinger

Authors
  1. W. Panny
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. H. Prodinger
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by R. Sedgewick.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Panny, W., Prodinger, H. Bottom-up mergesort — A detailed analysis. Algorithmica 14, 340–354 (1995). https://doi.org/10.1007/BF01294131

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words

Search

Navigation