Many other sorting algorithms can be specially implemented to be stable sorts. |
Many other sorting algorithms can be specially implemented to be stable sorts. One way of doing this is to artificially extend the key comparison, such that comparisons between two objects with otherwise equal keys are decided using the order of the entries in the original data order as a tie-breaker. |