Extended Euclidean Algorithm
This algorithm finds the GCD of two integers m and n, and integers a and b satisfying am + bn = gcd(m,n).
When this option is selected, the algorithm chooses
q so that |m-qn| is minimized. It will converge in fewer steps as a result.