Kirkpatrick–Reisch sort
Appearance
Kirkpatrick–Reisch sortingis a fastsorting algorithmfor items with limited-size integer keys. It is notable for having anasymptotic time complexitythat is better thanradix sort.[1][2]
References[edit]
- ^Czajka, Tomek (2020-06-06)."Faster than radix sort: Kirkpatrick-Reisch sorting".Sorting and Searching.Retrieved2020-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.ISSN0304-3975.