Question

Question 1 The method provided below takes two numbers, x and y, and using the method described by Euclid, returns their greatest common divisor (GCD - the largest positive integer that divides each of the integers, x and y without a remainder). public static int gcd(int while (y- 0) х, int y) { int temp yi у х % у; temp } return x; a) The method provided uses an iterative approach - rewrite the method so that it uses recursion You may use a helper method if you choose b) Write a single JUnit test for this method (e.g. successful usage). You may assume that the method ged, is in a class called MathUtil.

Answer 1

a)
public static int gcd(int x, int y) {
        if(y == 0) {
                return x;
        }       
        return (y, x % y);
}

b)

public void testGcd() {
        
        assertEquals(3, MathUtil.gcd(3, 9));
        assertEquals(1, MathUtil.gcd(3, 11));
        assertEquals(30, MathUtil.gcd(30, 30));
        assertEquals(10, MathUtil.gcd(30, 10));

}

please upvote. Thanks!