4 ms·

You don't need hash codes to be unique for items in the table so there doesn't need to be any relation between the size of the hash and the size of the table. T

You don't need hash codes to be unique for items in the table so there doesn't need to be any relation between the size of the hash and the size of the table. The time taken by the hash function depends on the size of the keys not the size of the table.

rand_r 10y ago
If they're not unique, it will have to linearly search through items with duplicate keys. This situation will begin to approach O(n) time, which isn't good.
- krona 10y ago
  Unless you're using an Open addressing scheme like cookoo which ensures constant lookup time in the worst case