Queue-mergesort
References (6)
Graph Algorithms
(1979)- M. Golin and R. Sedgewick, Mergesort and digital sums, In...
- 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)
Divide-and-conquer recurrences associated with generalized heaps, optimal merge, and related structures
2003, Theoretical Computer ScienceAn asymptotic theory for recurrence relations based on minimization and maximization
2003, Theoretical Computer ScienceThe Cost Distribution of Queue-Mergesort, Optimal Mergesorts, and Power-of-2 Rules
1999, Journal of AlgorithmsQuickXsort: A Fast Sorting Scheme in Theory and Practice
2020, AlgorithmicaAdaptive shivers sort: An alternative sorting algorithm
2020, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
- ∗∗
This research was supported by National Science Foundation grant DCR-8605962 and Office of Naval Research grant N00014-87-K-0460.
Copyright © 1993 Published by Elsevier B.V.