Top Qs
Timeline
Chat
Perspective
Kirkpatrick–Reisch sort
Fast sort algorithm for items with limited-size integer keys From Wikipedia, the free encyclopedia
Remove ads
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
Wikiwand - on
Seamless Wikipedia browsing. On steroids.
Remove ads