Quote: for nearly sorted lists, separate into sorted and unsorted lists, then sort and merge

Quotation Skeleton

[New Sorting Algorithm for nearly sorted lists (up to 20% out of order):] First the original list is scanned and … elements has been removed, the next pair compared … all of the elements in the original list, … more than 30 elements and by Quickersort otherwise. … [this is the best method with very smooth behavior over number element and percentage out of order. up to twice as fast as quickersort]   Google-1   Google-2

Copyright clearance needed for quotation.

Related Topics

Topic: sort algorithms (24 items)