Sorting unsorted and partially sorted lists using the natural merge sort
- 1 December 1981
- journal article
- Published by Wiley in Software: Practice and Experience
- Vol. 11 (12) , 1339-1340
- https://doi.org/10.1002/spe.4380111211
Abstract
No abstract availableKeywords
This publication has 1 reference indexed in Scilit:
- Best sorting algorithm for nearly sorted listsCommunications of the ACM, 1980