Elsevier

Information Processing Letters

Volume 48, Issue 5, 10 December 1993, Pages 253-259
Information Processing Letters

Queue-mergesort

https://doi.org/10.1016/0020-0190(93)90088-QGet rights and content

Abstract

Mergesort is one of the oldest and most venerable sorting algorithms and exists in many different flavors. In this short note we present yet another mergesort variant, queue-mergesort. We show that, like top-down mergesort but unlike bottom-up mergesort, this new variant performs an optimal number of comparisons in the worst case.

References (6)

  • S. Even

    Graph Algorithms

    (1979)
  • M. Golin and R. Sedgewick, Mergesort and digital sums, In...
  • R. Graham et al.

    Concrete Mathematics: A Foundation For Computer Science

    (1988)
There are more references available in the full text version of this article.

Cited by (13)

  • Adaptive shivers sort: An alternative sorting algorithm

    2020, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
View all citing articles on Scopus
∗∗

This research was supported by National Science Foundation grant DCR-8605962 and Office of Naval Research grant N00014-87-K-0460.

View full text