Question

Write a recursive method in java to find GCD of two integers using Euclid's method. Integers can be positive or negative.

public class Recursion {

                public static void main(String[] args) {

                                Recursion r = new Recursion();

                                System.out.println(“The GCD of 24 and 54 is “+r.findGCD(24,54)); //6

                }

                public int findGCD(int num1, int num2){

                                return -1;

                }

}

Answer 1

public class Recursion {

  public static void main(String[] args) {

    Recursion r = new Recursion();

    System.out.println("The GCD of 24 and 54 is "+r.findGCD(24,54)); //6

  }


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

$\color{blue}\underline{Output:}$

The GCD of 24 and 54 is 6

$\color{blue}Please\; upvote\;the \;solution \;if \;it \;helped.\;Thanks!$