Euclid.java

public class Euclid {
 
	static int iterativeGCD(int m, int n){
		while(n != 0){
			int r = m % n;
			m = n;
			n = r;
		}
		return m;
	}
 
	static int recursiveGCD(int m, int n){
		if(n == 0)
			return m;
		else{
			return recursiveGCD(n, m % n);
		}
	}
}