Question

Find the GCD of 72 and 100 using the Euclidean GCD algorithm.

In Java

Answer 1

The answer to this question is as follows:

The code is as follows:

import java.util.*;
public class GCD
{

   public static int gcd_numbers(int value1, int value2)
   {
       if (value1 == 0)
           return value2;
      
       return gcd_numbers(value2%value1, value1);
   }

   public static void main(String[] args)
   {
       int value1 = 72, value2= 100;
       System.out.println("GCD of "+value1+" and "+value2+" is:"+gcd_numbers(value1, value2));

   }
}

The input and ouput is as follows:

✓ Execute Mode, Version, Inputs & Arguments JDK 11.0.4 Interactive Stdin Inputs Command Line Arguments Execute ... Result CPU Time: 0.34 sec(s), Memory: 35692 kilobyte(s) compiled and executed in 1.041 sec(s) GCD of 72 and 100 is:4