if we take 2 pointers initialized with the start node with one moving in forward direction and other in backward direction and execute until both point to same node .it cud be workin faster i suppose...
On Thu, Aug 18, 2011 at 1:21 AM, Piyush Sinha <ecstasy.piy...@gmail.com>wrote: > We all knw hw to find a loop in a singly linked list (Using hare and > tortoise method)..what if the linked list is a doubly linked list?can > we do it smthn better than hare n tortoise method using the advantage > of the doubly linked list? > > -- > *Piyush Sinha* > *IIIT, Allahabad* > *+91-7483122727* > * <https://www.facebook.com/profile.php?id=100000655377926> "NEVER SAY > NEVER" > * > > -- > 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.
