Máximo común divisor en Java

Iterativo y recursivo

public class Mcd {

public static void main(String[] args) {
// TODO Auto-generated method stub
java.util.Scanner lee = new java.util.Scanner(System.in);
int n = lee.nextInt();
int m = lee.nextInt();
int divisor = mcd(n,m);
System.out.println(divisor);
System.out.println(mcd_iterativo(n,m));
lee.close();
}
public static int mcd(int a, int b){
if(a%b==0){
return b;
}else{
return mcd(b, a%b);
}
}
public static int mcd_iterativo(int a, int b){
while(a>0){
int aux = a;
a=b%a;
b=aux;
}
return b;
}
}