Question

C++ I do not understand this problem.

14THE GREATEST COMMON DENOMINATOR PROBLEM Write a function named god() that accepts two integers as input parameters and returns the greatest common divisor of the two numbers. The greatest common divisor (GCD) of two integers, a and b, is the largest integer that is a factor of both a and b. The GCD of any number and 1 is 1, and the GCD of any number and o is that number. One efficient way to compute the GCD of two numbers is to use Euclid's algorithm, which states the following: GCD(A, B) = GCD(B, A % B) GCD(A, 0) = Absolute value of A In other words, if you repeatedly take the remainder of A divided by B and then swap the two values, eventually B will store o and A will store the greatest common divisor. For example: gcd (24, 84) returns 12, gcd(105, 45) returns 15, and gcd(0, 8) returns 8.

Answer 1

#include <iostream>

using namespace std;

int GCD(int A, int B) {
    if (B == 0) {   // base case
        return A;   // if B is 0, return A
    } else {// recursive case
        return GCD(B, A % B);   // else, GCD(A, B) = GCD(B, A%B)
    }
}

int main() {
    int A, B;
    cout << "Enter A: ";
    cin >> A;
    cout << "Enter B: ";
    cin >> B;
    cout << "GCD(" << A << ", " << B << ") is " << GCD(A, B) << endl;
    return 0;
}