Hi Mallipeddi.

06-Jun-04 17:43:30, Mallipeddi  Rajesh wrote to All


 MR> From: "Mallipeddi  Rajesh" 

 MR> >7. Finding if there is any loop inside linked list.Take two
 MR> pointers(Pointer 1 and Pointer2) pointing to the first node and
 MR> the second node respectively. With Pointer1 traverse the list
 MR> leaving one node every time(i.e traversing only throughthe odd
 MR> nodes)and do the same with Pointer 2 ,traversing the same list
 MR> leaving one node every time but this pointer will be traversing
 MR> through the even nodes only.If there is only one loop in the list
 MR> then atleast  one of these two pointers  will reach the end(i.e
 MR> Ptr->next==NULL).Then check if the other pointers next to next
 MR> node is NULL or not. If it is NULL then there is no loop in the
 MR> list.If not there is a loop

that sounds interesting, but as I understand traversing a list with a loop
will never end.

  eg:

  list-->[node1.next]-->[node2.next]-->[node3.next]-->[node4.next]--.
                           /|\                                      |
                            `---------------------------------------'

you seem to have implemented a solution which translates the problem into
the halting problem. :)

 -=> Bye <=-

---