Category:Stable sorts
 | Computing portal |
Here is a list of articles in the category Stable sorts of the Computing portal that unifies foundations of mathematics and computations using computers. 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.
B
- Block sort (computing)
- Bubble sort (computing)
- Bucket sort (computing)
C
- Cascade merge sort (computing)
- Cocktail shaker sort (computing)
- Counting sort (computing)
- Cubesort (computing)
G
- Gnome sort (computing)
I
- Insertion sort (computing)
- Interpolation sort (computing)
L
- Library sort (computing)
M
- Merge sort (computing)
O
- Odd–even sort (computing)
- Oscillating merge sort (computing)
P
- Pigeonhole sort (computing)
- Proxmap sort (computing)
R
- Radix sort (computing)
T
- Timsort (computing)
Mathematics
Organizations
Books
About