Every story and comment from the Hacker News API, in a layout borrowed from 2001.
A comment on Aguri: Coolest Data Structure You've Never Heard Of. Parent comment
With a good hash function (collision resistant), the amortized cost of lookup is O(1), even if you need to resize the table.
There are no comments on this comment yet.
With a good hash function (collision resistant), the amortized cost of lookup is O(1), even if you need to resize the table.