Every story and comment from the Hacker News API, in a layout borrowed from 2001.
A comment on Big-O Algorithm Complexity Cheat Sheet. Parent comment
If k ∈ Θ(log N), then O(Nk) becomes O(N log N), which is asymptotically no better than any optimal comparison based sort.
However, if k ∈ o(log N), then we get an asymptotically better algorithm.
There are no comments on this comment yet.
If k ∈ Θ(log N), then O(Nk) becomes O(N log N), which is asymptotically no better than any optimal comparison based sort.
However, if k ∈ o(log N), then we get an asymptotically better algorithm.