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. See here for a more complete description.
Pages in category "Stable sorts"
The following 18 pages are in this category, out of 18 total. This list may not reflect recent changes.