Why is it that if a hash table that is n elements long where n, is a prime number, is likely to have collisions distributed evenly across all elements? How is this possible when the hashing function is not being considered?
Why is it that if a hash table that is n elements long where n, is a prime number, is likely to have collisions distributed evenly across all elements? How is this possible when the hashing function is not being considered?