Abstract
A sorting algorithm is adaptive if it sorts in time proportional to the length and the disorder of the input [6]. That is, when the input is nearly sorted, sorting is fast and only on randomly permuted inputs does it take O(n log n) comparisons. The main motivation behind adaptive sorting is that, in practice, nearly sorted inputs are more frequent, as opposed to the usual assumption for expected-case analysis that all inputs are equally likely.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
V. Estivill-Castro. Sorting and Measures of Disorder. PhD thesis, University of Waterloo, 1991. Åvailable as Department of Computer Science Research Report CS-91-07.
W.D. Frazer and A. C. McKellar. Samplesort: A sampling approach to minimal storage tree sorting. Journal of the ACM, 17(3):496–507, July 1970.
D.E. Knuth. The Art of Computer Programming, Vol.2: Seminumerical Algorithms. Addison-Wesley Publishing Co., Reading, Mass., 1973.
C. Levcopoulos and O. Petersson. Sorting shuffled monotone sequences. In J.R. Gilbert and R. Karlsson, editors, Proceedings of the 2nd Scandinavian Workshop on Algorithm Theory, pages 181–191, Bergen, Sweden, 1990. Springer-Verlag Lecture Notes in Computer Science 447.
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.
F. Mosteller. Fifty Challenging Problems in Probability with Solutions. Addison-Wesley Publishing Co., Reading, Mass., 1965.
S.S. Skiena. Encroaching lists as a measure of presortedness. BIT, 28:755–784, 1988.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer Science+Business Media New York
About this chapter
Cite this chapter
Estivill-Castro, V., Wood, D. (1992). Randomized Sorting of Shuffled Monotone Sequences. In: Baeza-Yates, R., Manber, U. (eds) Computer Science. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-3422-8_13
Download citation
DOI: https://doi.org/10.1007/978-1-4615-3422-8_13
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-6513-6
Online ISBN: 978-1-4615-3422-8
eBook Packages: Springer Book Archive