Java

Write a program that accept two integer number from user and compute the greatest common divisor using recursion method.

import java.util.*;

class GCDRecursion
{
public static void main(String args[])
{
Scanner sc = new Scanner(System.in);

System.out.print("Enter first number : ");
int num1 = sc.nextInt();

System.out.print("Enter second number : ");
int num2 = sc.nextInt();

System.out.println("Greatest Common Divisor of " + num1 + " and " + num2 + " is : " + greatestCommonDivisor(num1, num2));
}

static int greatestCommonDivisor(int num1, int num2)
{
if(num2 != 0)
{
return greatestCommonDivisor(num2, num1 %                            num2);
}
else
{
return num1;
}
}
}

Output :