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]
This computer science article is a stub.
You can help Wikipedia by expanding it.