Kirkpatrick–Reisch sort
Kirkpatrick–Reisch sorting is a fast sorting algorithm for items with limited-size integer keys.
Snapshot
≈ 1 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
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.
Text derived from https://en.wikipedia.org/w/index.php?oldid=1200276299 under CC BY-SA 4.0; modifications have been made.