Every story and comment from the Hacker News API, in a layout borrowed from 2001.
A comment on The time complexity of the libc++ deque push_front implementation is O(log n).
It reminds me of the hash maps that are said to be amortized O(1) but can be O(n) for some sequences of operations in various languages like Python and JS: https://blog.toit.io/hash-maps-that-dont-hate-you-1a96150b49...
There are no comments on this comment yet.
It reminds me of the hash maps that are said to be amortized O(1) but can be O(n) for some sequences of operations in various languages like Python and JS: https://blog.toit.io/hash-maps-that-dont-hate-you-1a96150b49...