Uniform Hashing Example
Currently looking at hash table examples and not quite sure about how I would go about this.
Suppose you have about 800 key values and you would like to have an average of about 3 elements in a chain of the hash table. More importantly, however, you would like to have uniform hashing. Select a hash function using the division method, based on the guidelines in this text. What is the hash table size?
Would the hash table size just be the total key values divided by the average of elements in a chain?
Suppose you have about 800 key values and you would like to have an average of about 3 elements in a chain of the hash table. More importantly, however, you would like to have uniform hashing. Select a hash function using the division method, based on the guidelines in this text. What is the hash table size?
Would the hash table size just be the total key values divided by the average of elements in a chain?
Last edited on
Topic archived. No new replies allowed.