why not first sort the lists first? (we could if we do not want to modify original list) it will give O(nLogn) solution
-Nitin On Wed, Aug 3, 2011 at 4:44 PM, veera reddy <veeracool...@gmail.com> wrote: > sry... misunderstood the question > > > On Wed, Aug 3, 2011 at 4:43 PM, veera reddy <veeracool...@gmail.com>wrote: > >> there is o(m+n) solution . >> http://geeksforgeeks.org/?p=2405 in this link see method no 4 >> >> >> On Wed, Aug 3, 2011 at 4:41 PM, ankit sambyal <ankitsamb...@gmail.com>wrote: >> >>> ya, I also can't think anything better than O(m*n) >>> >>> -- >>> 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. >>> >> >> >> >> -- >> Regards , >> P Veera Reddy Devagiri >> Senior Under Graduate >> Computer Science and Engineering >> IIIT Hyderabad >> Mobile no-+91-9492024783 >> > > > > -- > Regards , > P Veera Reddy Devagiri > Senior Under Graduate > Computer Science and Engineering > IIIT Hyderabad > Mobile no-+91-9492024783 > > -- > 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. > -- 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.
