Category:Stable sorts
From Wikipedia, the free encyclopedia
Stable sorting algorithms maintain the relative order of records with equal keys (i.e. the values remain in their original order if the keys are equal). 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.
Wikimedia Commons has media related to Stable sorts.