1
Faster than radix sort: Kirkpatrick-Reisch sorting
Radix sort sorts n w-bit integers by splitting them up into chunks of logn\log nlogn bits each, and sorting each chunk in linear time. Thus it achieves O(nw/logn)O(nw/\log n)O(nw/logn) time.
Sorting and Searching
A blog about interesting algorithms and data structures.
- Popular posts
- 1
- Total points
- 193
- HN comments
- 45
- Rank
- #13,097 personal
Visit sortingsearching.com → RSS feedOn Hacker News Jun 2020 – Jun 2020