News for hackers. Stuff that matters.
Re:Timsort, the Python sorting algorithm by joshuamorton on Tuesday October 08, 2019 @11:30PM (#21199741)
After a byte-wise radix sort you still have to sort within each bucket.

In the worst case, every element falls into a single bucket, at which point your best best is to do a bit wise radix sort over the low 8 bits.

This ends up being equivalent to k=log(n).

There are no comments on this comment yet.