Every story and comment from the Hacker News API, in a layout borrowed from 2001.
A comment on Neural programmer better than Quicksort. Parent comment
Yes. In particular, the O(n log n) lower bound holds for comparison sorts, that is algorithms that rely on pairwise comparison only.
There are no comments on this comment yet.
Yes. In particular, the O(n log n) lower bound holds for comparison sorts, that is algorithms that rely on pairwise comparison only.