Floyd's Tortoise and Hare algorithm, also known as cycle detection algorithm, uses two pointers moving at different speeds to detect a cycle in a linked list. The slow pointer (tortoise) moves one step at a time, while the fast pointer (hare) moves two steps. If there's a cycle, they'll eventually meet!