Every story and comment from the Hacker News API, in a layout borrowed from 2001.
A comment on Timsort, the Python sorting algorithm. Parent comment
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.
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).