News for hackers. Stuff that matters.
Re:Aguri: Coolest Data Structure You've Never Heard Of by marketer on Tuesday January 22, 2008 @12:25AM (#102037)
What do you mean hash tables are not O(1)?

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.