Sorting shuffled monotone sequences
- 1 January 1990
- book chapter
- Published by Springer Nature
- p. 181-191
- https://doi.org/10.1007/3-540-52846-6_88
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Sublinear merging and natural merge sortPublished by Springer Nature ,1990
- A new measure of presortednessInformation and Computation, 1989
- Encroaching lists as a measure of presortednessBIT Numerical Mathematics, 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
- On computing the length of longest increasing subsequencesDiscrete Mathematics, 1975
- Longest Increasing and Decreasing SubsequencesCanadian Journal of Mathematics, 1961