Kirkpatrick–Reisch sort
From HandWiki
Short description: 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" (in en). https://sortingsearching.com/2020/06/06/kirkpatrick-reisch.html.
- ↑ Kirkpatrick, David; Reisch, Stefan (1983-01-01). "Upper bounds for sorting integers on random access machines" (in en). Theoretical Computer Science 28 (3): 263–276. doi:10.1016/0304-3975(83)90023-3. ISSN 0304-3975.
 |  |
