Category:Comparison sorts
 | Computing portal |
Here is a list of articles in the Comparison sorts category of the Computing portal that unifies foundations of mathematics and computations using computers. A comparison sort is a particular type of sorting algorithm which can only read the list elements through a single abstract comparison operation (often a "less than" operator) that determines which of two elements should occur first in the final sorted list.
Pages in category "Comparison sorts"
The following 30 pages are in this category, out of 30 total.
A
- Adaptive heap sort (computing)
B
- Block sort (computing)
- Bogosort (computing)
- Bubble sort (computing)
C
- Cache-oblivious distribution sort (computing)
- Cascade merge sort (computing)
- Cocktail shaker sort (computing)
- Comb sort (computing)
- Cubesort (computing)
- Cycle sort (computing)
F
- Funnelsort (computing)
G
- Gnome sort (computing)
H
- Heapsort (computing)
I
- Insertion sort (computing)
- Introsort (computing)
L
- Library sort (computing)
M
- Merge sort (computing)
- Merge-insertion sort (computing)
- Multi-key quicksort (computing)
O
- Odd–even sort (computing)
- Oscillating merge sort (computing)
P
- Patience sorting (computing)
- Polyphase merge sort (computing)
Q
- Quicksort (computing)
S
- Selection sort (computing)
- Shellsort (computing)
- Smoothsort (computing)
- Sorting number (computing)
- Stooge sort (computing)
T
- Timsort (computing)
Mathematics
Organizations
Books
About