Why is the time-complexity O(F)+O© = O(n)-O(F) for both pointers to reach the cycle? I was a bit confused by the books explanation.
7.3 Java edition Test for Cyclicity
That is not a minus sign in the text. You can double check the book to see what is there.
1 Like