Extended Euclidean Algorithm

Find the GCD of two integers and the Bézout coefficients x, y such that ax + by = gcd(a, b). Also computes modular inverses when gcd = 1.