Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I was going through Floyd’s cycle finding algorithm today and had a doubt. Why would he need two pointers and move them at different speeds?
He can instead create two pointers keep one static and compare the pointer of it with another pointer, which he increments? I mean even that will result in finding cycles right?
The reason they need to move is that the cycle doesn’t necessarily have to loop the entire list of nodes.
For example, let’s say we have 4 nodes A->B->C->D->B
If we kept one pointer pointed at A, we’d never detect the cycle.