A framework for adaptive sorting
- 1 May 1995
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 59 (2) , 153-179
- https://doi.org/10.1016/0166-218x(93)e0160-z
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Sorting Shuffled Monotone SequencesInformation and Computation, 1994
- Sublinear merging and natural mergesortAlgorithmica, 1993
- Adaptive HeapsortJournal of Algorithms, 1993
- Splitsort—an adaptive sorting algorithmInformation Processing Letters, 1991
- A new measure of presortednessInformation and Computation, 1989
- Exploiting partial order with QuicksortSoftware: Practice and Experience, 1984
- Smoothsort, an alternative for sorting in situScience of Computer Programming, 1982
- Best sorting algorithm for nearly sorted listsCommunications of the ACM, 1980
- How good is the information theory bound in sorting?Theoretical Computer Science, 1976
- Sorting, trees, and measures of orderInformation and Control, 1958