Extended simple extended gcd.

ExtendedIterative finds and returns gcd(a, b), x, y satisfying a*x + b*y = gcd(a, b).

ExtendedRecursive finds and returns gcd(a, b), x, y satisfying a*x + b*y = gcd(a, b).

Iterative Faster iterative version of GcdRecursive without holding up too much of the stack.

Recursive finds and returns the greatest common divisor of a given integer.