Every story and comment from the Hacker News API, in a layout borrowed from 2001.
A comment on The skyline problem. Parent comment
https://briangordon.github.io/images/worstcase.svg
> n queries taking log(n) + n time each is O(n log n)
No, it's O(n^2).
https://briangordon.github.io/images/worstcase.svg
> n queries taking log(n) + n time each is O(n log n)
No, it's O(n^2).