January 13, 2003

‘ MergeSort. A stable sort (preserves original order of records with equal ‘ keys). Like HeapSort, easily adapted to any data type and guaranteed to run ‘ in O(N log

‘ HeapSort. A compact routine that sorts data in place (no extra memory needed)’ and is guaranteed to run in O(N log N) time no matter how the input data

‘ CombSort. A compact routine that sorts data in place (no extra memory needed)’ and runs in approximately O(N log N) time. Not stable (does not preserve ‘ original order