Sublinear merging and natural mergesort
- 1 June 1993
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 9 (6) , 629-648
- https://doi.org/10.1007/bf01190160
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- A framework for adaptive sortingPublished by Springer Nature ,1992
- Measures of Presortedness and Optimal Sorting AlgorithmsIEEE Transactions on Computers, 1985
- A simple linear-time algorithm for in situ mergingInformation Processing Letters, 1984
- Best sorting algorithm for nearly sorted listsCommunications of the ACM, 1980
- How good is the information theory bound in sorting?Theoretical Computer Science, 1976
- Sorting, trees, and measures of orderInformation and Control, 1958