Sorting and Searching personal blog
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.
- Points
- 193
- HN comments
- 45
- Submissions
- 1
- Cited by
- 0 commenters
Math & AlgorithmsSoftware Engineering2020
On Hacker News
| Submitted | Title on HN | Points | Comments |
|---|---|---|---|
| Jun 7, 2020 | Faster than radix sort: Kirkpatrick-Reisch sorting by milo_im | 193 | 45 |
