Kirkpatrick–Reisch sort
Fast sort algorithm for items with limited-size integer keys
Kirkpatrick–Reisch sorting is a fast sorting algorithm for items with limited-size integer keys. It is notable for having an asymptotic time complexity that is better than radix sort.[1][2]
References
- ^ Czajka, Tomek (2020-06-06). "Faster than radix sort: Kirkpatrick-Reisch sorting". Sorting and Searching. Retrieved 2020-06-09.
- ^ Kirkpatrick, David; Reisch, Stefan (1983-01-01). "Upper bounds for sorting integers on random access machines". Theoretical Computer Science. 28 (3): 263–276. doi:10.1016/0304-3975(83)90023-3. ISSN 0304-3975.
- v
- t
- e
Sorting algorithms
- Computational complexity theory
- Big O notation
- Total order
- Lists
- Inplacement
- Stability
- Comparison sort
- Adaptive sort
- Sorting network
- Integer sorting
- X + Y sorting
- Transdichotomous model
- Quantum sort
- Bubble sort
- Cocktail shaker sort
- Odd–even sort
- Comb sort
- Gnome sort
- Proportion extend sort
- Quicksort
- Block merge sort
- Kirkpatrick–Reisch sort
- Timsort
- Introsort
- Spreadsort
- Merge-insertion sort
 | This computer science article is a stub. You can help Wikipedia by expanding it. |
- v
- t
- e
