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 dan-robertson on Tuesday June 09, 2020 @03:17AM (#23464473)
The algorithm is to switch to a counting sort when w <= log n, ie n >= 2^w, so more properly the complexity is written:

  O(n+max(0,log(w/log n)))
[ Parent | on HN ]

There are no comments on this comment yet.