Splitsort—an adaptive sorting algorithm
- 30 August 1991
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 39 (4) , 205-211
- https://doi.org/10.1016/0020-0190(91)90181-g
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- A new measure of presortednessInformation and Computation, 1989
- Encroaching lists as a measure of presortednessBIT Numerical Mathematics, 1988
- Practical in-place mergingCommunications of the ACM, 1988
- A class of sorting algorithms based on QuicksortCommunications of the ACM, 1985
- 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