| 
|
QuoteRef: cookCR11_1980
topics >
all references >
ThesaHelp:
ACM references a-e
ThesaHelp:
references c-d
Topic:
sort algorithms
Reference
Cook, C.R., Kim, D.J., "Best sorting algorithm for nearly sorted lists ", Communications of the ACM , 23, 11, pp. 620-624 , November 1980. Google
621 ;;Quote: for nearly sorted lists, insertion sort is best for small or very-nearly sorted lists; otherwise use Quicker-sort
622 ;;Quote: for nearly sorted lists, separate into sorted and unsorted lists, then sort and merge
ThesaHelp: ACM references a-e (259 items)
ThesaHelp: references c-d (337 items)
Topic: sort algorithms (24 items)