Hi, How do you choose a good hash function?
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Choosing a good hashing function, h(k), is essential for hash-table based searching. h should distribute the elements of our collection as uniformly as possible to the « slots » of the hash table. The key criterion is that there should be a minimum number of collisions. will provide uniform hashing.