Kirkpatrick–Reisch sort

{{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.{{Cite web|last=Czajka|first=Tomek|date=2020-06-06|title=Faster than radix sort: Kirkpatrick-Reisch sorting|url=https://sortingsearching.com/2020/06/06/kirkpatrick-reisch.html|access-date=2020-06-09|website=Sorting and Searching|language=en}}{{Cite journal|last1=Kirkpatrick|first1=David|last2=Reisch|first2=Stefan|date=1983-01-01|title=Upper bounds for sorting integers on random access machines|journal=Theoretical Computer Science|language=en|volume=28|issue=3|pages=263–276|doi=10.1016/0304-3975(83)90023-3|issn=0304-3975|doi-access=}}