Java Program to find GCD

Posted in Java Tutorial

Updated on Nov 16, 2024

By Mari Selvan

👁️ 58 - Views

⏳ 4 mins

💬 1 Comment

Photo Credit to CodeToFun

🙋 Introduction

In the realm of programming, solving mathematical problems is a common and essential task. One frequently encountered mathematical concept is the Greatest Common Divisor (GCD) of two numbers.

The GCD is the largest positive integer that divides both numbers without leaving a remainder.

In this tutorial, we'll explore a Java program that efficiently calculates the GCD of two given numbers.

📄 Example

Let's take a look at the Java code that achieves this functionality.

GCDCalculator.java

Copied

public class GCDCalculator {

// Function to find GCD using Euclidean algorithm
static int findGCD(int num1, int num2) {
  while (num2 != 0) {
    int temp = num2;
    num2 = num1 % num2;
    num1 = temp;
  }
  return num1;
}

// Driver program
public static void main(String[] args) {
  // Replace these values with your desired numbers
  int number1 = 48;
  int number2 = 18;

  // Call the function to find GCD
  int gcd = findGCD(number1, number2);

  System.out.println("GCD of " + number1 + " and " + number2 + " is: " + gcd);
}
}

💻 Testing the Program

To test the program with different numbers, simply replace the values of number1 and number2 in the main method.

Output

GCD of 48 and 18 is: 6

Compile and run the program to see the GCD in action.

🧠 How the Program Works

The program defines a class GCDCalculator containing a static method findGCD that takes two numbers as input and uses the Euclidean algorithm to calculate their GCD.
Inside the main method, replace the values of number1 and number2 with the desired numbers.
The program calls the findGCD method and prints the result.

🧐 Understanding the Euclidean Algorithm

The Euclidean algorithm is a widely used method for finding the GCD of two numbers. It iteratively replaces the larger number with the remainder of the division of the larger number by the smaller number until the remainder becomes zero. The GCD is then the non-zero remainder.

🌐 Real-World Applications

Understanding and calculating the GCD is essential in various fields, including cryptography, computer science, and number theory.

For instance, it plays a crucial role in algorithms for reducing fractions to their simplest form.

🎢 Optimizing the Program

While the provided program is effective, there are other algorithms, such as the Stein algorithm, that can be more efficient for large numbers. Consider exploring and implementing different algorithms based on your specific requirements.

Feel free to incorporate and modify this code as needed for your specific use case. Happy coding!