News for hackers. Stuff that matters.

A comment on Faster than radix sort: Kirkpatrick-Reisch sorting. Parent comment

Re:Faster than radix sort: Kirkpatrick-Reisch sorting by karpierz on Tuesday June 09, 2020 @03:04AM (#23464421)
The recursion assumes that log(n) > w; if log(n) <= w, then you're in the base case and it's O(n).
[ Parent | on HN ]

There are no comments on this comment yet.