Click here to Skip to main content
15,743,427 members
Please Sign up or sign in to vote.
0.00/5 (No votes)
See more:
Hey guys!
I have been trying to implement the dictionary(english-english) using hashing which will of course be having words stored. the problem I am currently facing in the insertion is the hash key collisions. I can generate the random hash key to every new word but when retrieving it will be impossible to retrieve a particular word. So if you guys could suggest me the formula to generate the UNIQUE hash key to every new word.

Regards :)
Updated 3-Apr-10 5:49am

i know no hashing could be collion less totally..but at least there must be least collisions..thats wat i emant .. :)
Share this answer
That can't be done. See here[^].

Share this answer

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

CodeProject, 20 Bay Street, 11th Floor Toronto, Ontario, Canada M5J 2N8 +1 (416) 849-8900