00 Euclidean algorithm programming

Algorithm: Calculate the greatest common divisor of two integers Euclidean algorithm.
Algorithm flow chart:

Algorithm Java implementation:

//非递归实现
public static int gcd(int a, int b) {
	if( a < b ) {
		int t = a;
		a = b;
		b = t;
	}
	
	while( b != 0 ) {
		int r = a % b;
		a = b;
		b = r;
	}
	
	return a;
}

//递归实现
public static int gcd(int a, int b) {
		if( b == 0) {
			return a;
		}else {
			return gcd(b, a%b);
		}
	}