Category:Stable sorts
Template:Sister project 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.
Script error: No such module "anchor".Pages in category "Stable sorts"
The following 9 pages are in this category, out of 9 total.