Bézout's equation for Gaussian integers
The Euclidean algorithm for Gaussian integers,
properly done, starts with Gaussian integers a
and b and calculates Gaussian integers s and t such that
sa + tb divides both a and b. It follows
that sa + tb is a greatest common divisor of
a and b.
Warning: The program may interchange a and b.