Hash code formula, anyone?
I have a dictionary to store into a hash table. I want the words to be grouped together by anagrams (for example, toxic and ioxct would be in the same bucket).
I am aiming for minimal collisions and an efficiency of O(log n) or less when being probed.
Does anyone have any ideas or suggestions for a formula for generating my hash code?
I am aiming for minimal collisions and an efficiency of O(log n) or less when being probed.
Does anyone have any ideas or suggestions for a formula for generating my hash code?
