3 ms·

Cuckoo hashing has O(1) worst-case access time, and O(1) "average" (amortized, to be correct) insert time.

• 16s 16y ago
  OK. That makes sense. If O(1) is worst case, what could be better :)
  • rudiger 16y ago
    Well, smaller constant factors could be better :)