Every story and comment from the Hacker News API, in a layout borrowed from 2001.
A comment on Efficient Amortised and Real-Time Queues in Haskell. Parent comment
"The add operation runs in amortized constant time, that is, adding n elements requires O(n) time."
There are no comments on this comment yet.
"The add operation runs in amortized constant time, that is, adding n elements requires O(n) time."