Stable sorts

Wikimedia Commons has media related to Stable sorts.

Stable sorting algorithms maintain the relative order of records with equal keys (i.e. values). That is, a sorting algorithm is stable if whenever there are two records R and S with the same key and with R appearing before S in the original list, R will appear before S in the sorted list. The Sorting algorithm article provides a more complete description of this.