Every story and comment from the Hacker News API, in a layout borrowed from 2001.
A comment on Writing a Faster Sorting Algorithm. Parent comment
If something is O(1) it's also O(n) and O(n!), since it's an upper bound.
There are no comments on this comment yet.
If something is O(1) it's also O(n) and O(n!), since it's an upper bound.