A framework for adaptive sorting
- 1 January 1992
- book chapter
- Published by Springer Nature
- p. 422-433
- https://doi.org/10.1007/3-540-55706-7_38
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Historical searching and sortingPublished by Springer Nature ,1991
- Sublinear merging and natural merge sortPublished by Springer Nature ,1990
- Sorting shuffled monotone sequencesPublished by Springer Nature ,1990
- A new measure of presortednessInformation and Computation, 1989
- Local insertion sort revisitedPublished by Springer Nature ,1989
- Measures of Presortedness and Optimal Sorting AlgorithmsIEEE Transactions on Computers, 1985
- Exploiting partial order with QuicksortSoftware: Practice and Experience, 1984
- 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