To find whether Single Linked List is looped.
 

Hi all,

What is the effficient way to check whether a single linked list is looped somewhere.The number of nodes in the list is not known.
In that case traversal of SLL will go into an infinite loop.

One solution I have is to store each address of node in array and compare the nest address with the address in the array. But this solution will be of order O(n*n). Can somebody give me an efficient solution.

Re: To find whether Single Linked List is looped.
 

For a discussion of detecting cycles in linked lists, see http://ostermiller.org/find_loop_sin...nked_list.html

-bobd-

Re: To find whether Single Linked List is looped.
 

Thnks BOBD