Kirkpatrick–Reisch sort explained

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]

Notes and References

  1. Web site: Czajka. Tomek. 2020-06-06. Faster than radix sort: Kirkpatrick-Reisch sorting. 2020-06-09. Sorting and Searching. en.
  2. Kirkpatrick. David. Reisch. Stefan. 1983-01-01. Upper bounds for sorting integers on random access machines. Theoretical Computer Science. en. 28. 3. 263–276. 10.1016/0304-3975(83)90023-3. 0304-3975.

This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "Kirkpatrick–Reisch sort".

Except where otherwise indicated, Everything.Explained.Today is © Copyright 2009-2024, A B Cryer, All Rights Reserved. Cookie policy.