I understand in Floyds cycle, you are finding a cycle in a linked list by moving two counters- one by a factor of 2, other by a factor of 1. In Brents you are basically doing the same but the one factor moves by multiplying 2 instead by merely adding 2. Is there any math explanation behind why Brents is faster than Floyds?
Why is Brent's Cycle Detection method faster at finding a Linked List cycle than Floyd's Cycle Detection method?
algorithm analysis;runtime analysis