Abstract
We present a general constructive principle for the design of adaptive sorting algorithms that enables us to focus attention on the combinatorial properties of measures of presortedness rather than on the combinatorial properties of sorting algorithms. Using it, we obtain a practical adaptive sorting algorithm, optimal with respect to five important measures of presortedness and smoothly adaptive from O(n) to O(n log n) time for other common measures. Moreover, we extend the proof techniques to analyze an adaptive variant of Quicksort; previous claims were based only on simulation results.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
C.R. Cook and D.J. Kim. Best sorting algorithms for nearly sorted lists. Communications of the ACM, 23:620–624, 1980.
E.W. Dijkstra. Smoothsort, an alternative to sorting in situ. Science of Computer Programming, 1:223–233, 1982.
P.G. Dromey. Exploiting partial order with Quicksort. Software — Practice and Experience, 14(6):509–518, 1984.
V. Estivill-Castro and D. Wood. A generic adaptive sorting algorithm. Computer Journal. To appear.
V. Estivill-Castro and D. Wood. A new measure of presortedness. Information and Computation, 83:111–119, 1989.
J. D. Harris. Sorting unsorted and partially sorted lists using the natural merge sort. Software — Practice and Experience, 11:1339–1340, 1981.
D.E. Knuth. The Art of Computer Programming, Vol.3: Sorting and Searching. Addison-Wesley Publishing Co., Reading, Mass., 1973.
C. Levcopoulos and O. Petersson. Heapsort — adapted for presorted files. In F. Dehne, J.R. Sack, and N. Santoro, editors, Proceedings of the Workshop on Algorithms and Data Structures, pages 499–509. Springer-Verlag Lecture Notes in Computer Science 382, 1989.
C. Levcopoulos and O. Petersson. Splitsort—an adaptive sorting algorithm. Technical report, Department of Computer Science, Lund University, 1989.
H. Mannila. Measures of presortedness and optimal sorting algorithms. IEEE Transactions on Computers, C-34:318–325, 1985.
K. Mehlhorn. Data Structures and Algorithms, Vol 1: Sorting and Searching. EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Berlin/Heidelberg, 1984.
S.S. Skiena. Encroaching lists as a measure of presortedness. BIT, 28:755–784, 1988.
R.L. Wainwright. A class of sorting algorithms based on Quicksort. Communications of the ACM, 28:396–402, 85.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Estivill-Castro, V., Wood, D. (1991). Practical adaptive sorting. In: Dehne, F., Fiala, F., Koczkodaj, W.W. (eds) Advances in Computing and Information — ICCI '91. ICCI 1991. Lecture Notes in Computer Science, vol 497. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54029-6_153
Download citation
DOI: https://doi.org/10.1007/3-540-54029-6_153
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54029-8
Online ISBN: 978-3-540-47359-6
eBook Packages: Springer Book Archive