Misplaced Pages

Kirkpatrick–Reisch sort

Article snapshot taken from Wikipedia with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.
(Redirected from Kirkpatrick-Reisch sorting) 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.

References

  1. Czajka, Tomek (2020-06-06). "Faster than radix sort: Kirkpatrick-Reisch sorting". Sorting and Searching. Retrieved 2020-06-09.
  2. 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. ISSN 0304-3975.
Sorting algorithms
Theory
Exchange sorts
Selection sorts
Insertion sorts
Merge sorts
Distribution sorts
Concurrent sorts
Hybrid sorts
Other
Impractical sorts


Stub icon

This computer science article is a stub. You can help Misplaced Pages by expanding it.

Categories: