Encroaching lists as a measure of presortedness
- 1 December 1988
- journal article
- research article
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 28 (4) , 775-784
- https://doi.org/10.1007/bf01954897
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- A class of sorting algorithms based on QuicksortCommunications of the ACM, 1985
- Introduction --SortingIEEE Transactions on Computers, 1985
- Measures of Presortedness and Optimal Sorting AlgorithmsIEEE Transactions on Computers, 1985
- Smoothsort's behavior on presorted sequencesInformation Processing Letters, 1983
- Smoothsort, an alternative for sorting in situScience of Computer Programming, 1982
- Best sorting algorithm for nearly sorted listsCommunications of the ACM, 1980
- On the Average Number of Maxima in a Set of Vectors and ApplicationsJournal of the ACM, 1978
- A variational problem for random Young tableauxAdvances in Mathematics, 1977
- Longest Increasing and Decreasing SubsequencesCanadian Journal of Mathematics, 1961