Euclid's Algorithm for GCD

EuclidAlgo.java

public class EuclidAlgo {
    public static void main(String ...arg) {
        Scanner scanner = new Scanner(System.in);
        int m = scanner.nextInt();
        int n = scanner.nextInt();


        System.out.println("GCD: "+ gcd(m, n));
    }

    private static int gcd(int m, int n) {
        int r = m % n;
        int q = m / n;

        if(r == 0) return n;

        return gcd(n, r);
    }
}