Enter two integers below to visualize how the Euclidean Algorithm finds their Greatest Common Divisor (GCD). The algorithm works by repeatedly tiling a rectangle with the largest possible squares. The side length of the final square is the GCD.