3 ms·

It's smaller than the key, but the size of the domain is the number of items you've put in the array.

• bialpio 8y ago
  Actually, I might have misunderstood you. In your example, the index in the array is treated like the hash of the item you've put in there, why are we suddenly considering pointers?
  • gumby 8y ago
    In this degenerate case the "hash function" is base_address+(index*sizeof(memory_address))
    • bialpio 8y ago
      Not really, the function is still f(key) = <some number>, the rest is just taking the number and mapping it to the hardware that you're on.