Example

In the animation below you can see how Euclid's algorithm finds the greatest common divisor of two integers.