A survey of adaptive sorting algorithms
- 1 December 1992
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 24 (4) , 441-476
- https://doi.org/10.1145/146370.146381
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- A survey of adaptive sorting algorithmsACM Computing Surveys, 1992
- Encroaching lists as a measure of presortednessBIT Numerical Mathematics, 1988
- Combinatorics, complexity, and randomnessCommunications of the ACM, 1986
- A class of sorting algorithms based on QuicksortCommunications of the ACM, 1985
- Replacement Selection in 3-level MemoriesThe Computer Journal, 1984
- Smoothsort, an alternative for sorting in situScience of Computer Programming, 1982
- Sorting unsorted and partially sorted lists using the natural merge sortSoftware: Practice and Experience, 1981
- Multiway replacement selection sort with dynamic reservoirThe Computer Journal, 1977
- A List Insertion Sort for Keys With Arbitrary Key DistributionACM Transactions on Mathematical Software, 1976
- Sorting by natural selectionCommunications of the ACM, 1972