Breaking News: Grepper is joining You.com. Read the official announcement!

floyd's tortoise and hare

Jittery Jackal answered on October 29, 2022 Popularity 10/10 Helpfulness 1/10

answer floyd's tortoise and hare

related cycle detection floyd's tortoise and hare

floyd's tortoise and hare

Comments(1)

#source: https://dev.to/alisabaj/floyd-s-tortoise-and-hare-algorithm-finding-a-cycle-in-a-linked-list-39af and https://www.youtube.com/watch?v=pKO9UjSeLew
#method used to find a cycle if there is one in a linked list, assuming atleast two elements in list.
linkl = {} #each element should be like "number_as_string":["data","next"] and null should be None
def is_cycle():
	turtle, hare = 0, 1
	while not linkl[str(turtle)][1] == linkl[str(hare)][1]:
    	if (linkl[str(turtle)][1] is None) or (linkl[str(hare)][1] is None): return -1
        turtle = linkl[str(turtle)][1]; hare = linkl[str(linkl[str(hare)][1])][1]
	return linkl[str(turtle)][1]

Popularity 10/10 Helpfulness 1/10 Language python

Source: Grepper

Tags: cycle detection python

Link to this answer
Share Copy Link

Contributed on Oct 29 2022

Jittery Jackal

0 Answers Avg Quality 2/10

Closely Related Answers

cycle detection floyd's tortoise and hare

Comment

# Python code for the above approach (snippet sorry)
class Node:
    def __init__(self, d):
        self.data = d
        self.next = None
 
# initialize a new head for the linked list
head = None
 
# detect if there is a loop
# in the linked list
def detectLoop(head):
    slowPointer = head
    fastPointer = head
 
    while (slowPointer != None
           and fastPointer != None
           and fastPointer.next != None):
        slowPointer = slowPointer.next
        fastPointer = fastPointer.next.next
        if (slowPointer == fastPointer):
            return 1
 
    return 0
 
# inserting new values
head = Node(10)
head.next = Node(20)
head.next.next = Node(30)
head.next.next.next = Node(40)
head.next.next.next.next = Node(50)
 
# adding a loop for the sake
# of this example
temp = head
while (temp.next != None):
    temp = temp.next
 
temp.next = head
 
# loop added;
if (detectLoop(head)):
    print("Loop exists in the Linked List")
else:
    print("Loop does not exists in the Linked List")
 
# This code is contributed by Saurabh Jaiswal from GeeksforGeeks

Popularity 7/10 Helpfulness 1/10 Language python

Source: www.geeksforgeeks.org

Tags: cycle-detection

Link to this answer
Share Copy Link

Contributed on Oct 29 2022

Jittery Jackal

0 Answers Avg Quality 2/10

floyd's tortoise and hare

Contents

More Related Answers

floyd's tortoise and hare

Closely Related Answers

cycle detection floyd's tortoise and hare

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.