@Anurag: Any other efficient way you can think of ? On Fri, Jun 11, 2010 at 9:30 PM, Anurag Sharma <anuragvic...@gmail.com>wrote:
> Ya that will do.. > > Anurag Sharma > > > > On Fri, Jun 11, 2010 at 7:08 PM, Raj N <rajn...@gmail.com> wrote: > >> Given a circular linked list, what is the most efficient way of >> constructing a new list which contains the common elements between the >> 2 given lists. >> >> Is it sorting and then comparing ? >> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To post to this group, send email to algoge...@googlegroups.com. >> To unsubscribe from this group, send email to >> algogeeks+unsubscr...@googlegroups.com<algogeeks%2bunsubscr...@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 algoge...@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com<algogeeks%2bunsubscr...@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 algoge...@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.