Category:Stable sorts

From Wikipedia, the free encyclopedia

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.

Pages in category "Stable sorts"

The following 13 pages are in this category, out of 13 total. Updates to this list can occasionally be delayed for a few days.

B

C

G

I

L

M

O

P

R
Languages