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.
- Adaptive heap sort (computing)
- Funnelsort (computing)
- Gnome sort (computing)
- Heapsort (computing)
- Library sort (computing)
- Quicksort (computing)
- Timsort (computing)