Its not a question of reversing the hash function but given the key again you need to be able to retrieve the data in the hash table. If a random hash function is used every time to index into the hash table it would not be possible to retrieve the data back cheaply (There have been attempts to find a universal hash function class of small size and try all the functions each time to find if a value is present..but thats not very practical).
--~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
