greatest common divisor java

Greatest common divisor java

greatest common divisor java

Find Greatest Common Divisor (GCD) of 2 numbers using recursion. Numbers should be taken as input from the user.

import java.util.Scanner;
public class GCDCalculation
{
    public static void main(String args[])
{
    Scanner scanner = new Scanner(System.in);
    System.out.print("Please enter first number to find GCD : ");
    int number1 = scanner.nextInt();
    System.out.print("Please enter second number to find GCD : ");
    int number2 = scanner.nextInt();
    System.out.println("GCD of two numbers " + number1 +" and " + number2 +" is :" + findGCD(number1,number2));
}
    private static int findGCD(int number1, int number2)
    {
        if(number2 == 0)
        {
            return number1;
        }
        return findGCD(number2, number1%number2);
    }
}