Home

[This page is auto-generated; please prefer to read the article’s PDF Form.]

Finding n

When the cycle-searching loop terminates, both R₁ and R₂ are at element e_t (= e_2t). We know that e_t belongs to the cycle. Now, if R₁ is stepped n times, it must again meet R₂. So, we can iteratively step R₁ till it meets R₂, while counting the steps. This step count will be n.

The “Find n” part in method floyd() implements this approach.

[Prev]   [Up]   [Next]   

Copyright © 2021 Nitin Verma. All rights reserved.