The hash table would be used by separate chaining method not open addressing because it may not find the correct entry efficiently in the hash table . In case of open addresssing the value gets entered in the first available entry after collision.
In case of insertion :- (I have considered only simple insertion as It is not been mentioned ) U can insert the element in the linked list at the end . In case of deletion :- you need to find the address of the node from the hashed table which is to be deleted . you can delete it .... Hope u know the logic to delete the node of the whose address is only known . For that case we also need to Invalidate the entry in the hash table and update the entry of the next node in the hash table . I hope I am clear In case of searching . Hashing table will serve the purpose . -- 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 algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.