Java Program to Calculate the Greatest Common Divisor of Two Numbers Using Recursion

You are currently viewing Java Program to Calculate the Greatest Common Divisor of Two Numbers Using Recursion

Java program to calculate the Greatest Common Divisor of two numbers using recursion

// Java program to calculate the Greatest Common Divisor 
// of two numbers using recursion

import java.util.*;

public class Main {
  public static int calGCD(int num1, int num2) {
    while (num1 != num2) {
      if (num1 > num2)
        return calGCD(num1 - num2, num2);
      else
        return calGCD(num1, num2 - num1);
    }
    return num1;
  }

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

    int num1 = 0;
    int num2 = 0;
    int res = 0;

    System.out.printf("Enter number1: ");
    num1 = X.nextInt();

    System.out.printf("Enter number2: ");
    num2 = X.nextInt();

    res = calGCD(num1, num2);
    System.out.printf("GCD is: " + res);
  }
}

Output

Enter number1: 12
Enter number2: 9
GCD is: 3

Ranjith

Hi, I'm Manoj a full-time Blogger, YouTuber, Affiliate Marketer, & founder of Coding Diksha. Here, I post about programming to help developers.

Leave a Reply