GCD-recursive

import java.util.Scanner;

public class GCD {
    public static void main (String[] args) {
        Scanner input = new Scanner(System.in);
        System.out.println("Give me 2 numbers for GCD question: ");
        int x = input.nextInt();
        int y = input.nextInt();
        int z = gcd1(x,y);
        System.out.println("GCD of "  + x + " and " + y + " are " + z);
    }

public static int recursiveGCD_ajarn(int a, int b) {
       if(b >a) {
           int temp = b; b = a; a = temp;
       }
       // base case         
       if(b == 0) return a;
       else return recursiveGCD_ajarn(b, a%b);
    }
}