We have discussed Floyd’s fast and slow pointer algorithms in Detect loop in a linked list.
The algorithm is to start two pointers, slow and fast from head of linked list. We move slow one node at a time and fast two nodes at a time. If there is a loop, then they will definitely meet. This approach works because of the following facts.
1) When slow pointer enters the loop, the fast pointer must be inside the loop. Let fast pointer be distance k from slow.
2) Now if consider movements of slow and fast pointers, we can notice that distance between them (from slow to fast) increase by one after every iteration. After one iteration (of slow = next of slow and fast = next of next of fast), distance between slow and fast becomes k+1, after two iterations, k+2, and so on. When distance becomes n, they meet because they are moving in a cycle of length n.
For example, we can see in below diagram, initial distance is 2. After one iteration, distance becomes 3, after 2 iterations, it becomes 4. After 3 iterations, it becomes 5 which is distance 0. And they meet.
How does cycle removal algorithm work?
Please see method 3 of Detect and Remove Loop in a Linked List
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
- Rearrange a Linked List in Zig-Zag fashion | Set-2
- Flatten a binary tree into linked list
- Move first element to end of a given Linked List
- Hashtables Chaining with Doubly Linked Lists
- Sort the biotonic doubly linked list | Set-2
- Longest Common Prefix | Set 6 (Linked List)
- Reverse a Linked List according to its Size
- Delete multiple occurrences of key in Linked list using double pointer
- Program to find size of Doubly Linked List