Every story and comment from the Hacker News API, in a layout borrowed from 2001.
A comment on Bead sort: faster than O(N log N) sort. Parent comment
Perhaps you can make it smaller than log(n) for many use cases by restricting the type of input you accept but O(f(x)) only refers to the worse case.
There are no comments on this comment yet.
Perhaps you can make it smaller than log(n) for many use cases by restricting the type of input you accept but O(f(x)) only refers to the worse case.