Floyd's Cycle-Finding Algorithm

Observe how the slow pointer (Tortoise, +1 step) and fast pointer (Hare, +2 steps) guarantee intersection inside a loop.

T H
Step 0 Tortoise: Node 1 Hare: Node 1

Initial State: Both pointers start at Node 1 (head of linked list).