Premium
Sorting unsorted and partially sorted lists using the natural merge sort
Author(s) -
Harris James D.
Publication year - 1981
Publication title -
software: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 70
eISSN - 1097-024X
pISSN - 0038-0644
DOI - 10.1002/spe.4380111211
Subject(s) - sort , merge (version control) , merge sort , merge algorithm , computer science , sorting algorithm , sorting , algorithm , parallel computing , information retrieval
Abstract A version of the natural merge sort is shown to be an efficient method for both nearly sorted data and for random data. This method is compared with quickersort, 2‐way merge sort, and Cook and Kim's method for various sortedness ratios.