Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
karpierz
on June 9, 2020
|
parent
|
context
|
favorite
| on:
Faster than radix sort: Kirkpatrick-Reisch sorting
The recursion assumes that log(n) > w; if log(n) <= w, then you're in the base case and it's O(n).
Consider applying for YC's Spring batch! Applications are open till Feb 11.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
