If a hash collision occurs people resolve it some how moving to other empty locations by rehashing or by Chaining. Fine. I understand this in case of "insert".
During "search" on a HashTable, what will happen if there is a collision? I mean if it points to a wrong index for a key value...Than we have retrieved the wrong record. How such a scenario is handled? Thanks, Vinodh --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
