Euclid's algorithm

Implement int gcd(int a, int b): the greatest common divisor. While b != 0, replace (a, b) with (b, a % b); the answer is the final a. This is the classic loop-with-variables trace.