Improved Euclidean Algorithm - Expii

Improved Euclidean algorithm: gcd(a, b) = gcd(a, r), where r is any integer congruent to b (mod a). For example, r could be the remainder when b is divided by a.