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 th

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.