Thanks for your reply. These two lists keep changing on every iteration(every iteration gives a new sorted list),I have to find the common elements in two frest lists on every iteration. So if I create a hash table for one of the lists, then the hash table itself would have to be recreated everytime, Creating the hash table would probably take O(n) time. So I may not be able to use that. If you have anymore suggestions, I would like to try them out....
--~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
