Best sorting algorithm for nearly sorted lists

Authors:
Curtis R. Cook;Do Jin Kim
Affiliations:
Oregon State Univ., Corvallis;National Semi-Conductor, Sunnyvale, CA
Venue:
Communications of the ACM
Year:
1980

Citing 9
Cited 16

The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Internal Sorting by Radix Plus Sifting

Journal of the ACM (JACM)
Sorting

ACM Computing Surveys (CSUR)
Some performance tests of “quicksort” and descendants

Communications of the ACM
Algorithm 245: Treesort

Communications of the ACM
Algorithm 271: quickersort

Communications of the ACM
Algorithm 64: Quicksort

Communications of the ACM
Algorithm 207: stringsort

Communications of the ACM
Sorting Presorted Files

Proceedings of the 4th GI-Conference on Theoretical Computer Science

A class of sorting algorithms based on Quicksort

Communications of the ACM - Lecture notes in computer science Vol. 174
On generating random permutations with arbitrary distributions

CSC '89 Proceedings of the 17th conference on ACM Annual Computer Science Conference
On partitions and presortedness of sequences

SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
A survey of adaptive sorting algorithms

ACM Computing Surveys (CSUR)
Quicksort algorithms with an early exit for sorted subfiles

CSC '87 Proceedings of the 15th annual conference on Computer Science
Parallel merge-sort algorithms on the HEP

CSC '86 Proceedings of the 1986 ACM fourteenth annual conference on Computer science
An asymptotic theory for Cauchy---Euler differential equations with applications to the analysis of algorithms

Journal of Algorithms - Analysis of algorithms
Sorting and searching in the presence of memory faults (without redundancy)

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Acceleration of sweep-line technique by employing smart quicksort

Information Sciences—Informatics and Computer Science: An International Journal
A framework for adaptive algorithm selection in STAPL

Proceedings of the tenth ACM SIGPLAN symposium on Principles and practice of parallel programming
The price of resiliency: a case study on sorting with memory faults

ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Inversion-sensitive sorting algorithms in practice
Sorting and order statistics

Algorithms and theory of computation handbook
An empirical study for inversions-sensitive sorting algorithms

WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Resilient algorithms and data structures

CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Rotated library sort

CATS '13 Proceedings of the Nineteenth Computing: The Australasian Theory Symposium - Volume 141

Quantified Score

Hi-index	48.22

Visualization

Abstract

Straight Insertion Sort, Shellsort, Straight Merge Sort,Quickersort, and Heapsort are compared on nearly sorted lists. Theratio of the minimum number of list elements which must be removedso that the remaining portion of the list is in order to the sizeof the list is the authors' measure of sortedness. Tests onrandomly generated lists of various combinations of list length andsmall sortedness ratios indicate that Straight Insertion Sort isbest for small or very nearly sorted lists and that Quickersort isbest otherwise. Cook and Kim also show that a combination of theStraight Insertion Sort and Quickersort with merging yields asorting method that performs as well as or better than eitherStraight Insertion Sort or Quickersort on nearly sorted lists.