Euclidean Algorithm (GCD)

Finds the greatest common divisor by repeatedly replacing (a, b) with (b, a mod b) until b is 0.