Every story and comment from the Hacker News API, in a layout borrowed from 2001.
A comment on An interesting data structure with search time O(sqrt n). Parent comment
> Then you would insert the max you just removed into the next heap in the same way, and so on.
There are no comments on this comment yet.
> Then you would insert the max you just removed into the next heap in the same way, and so on.