Question

2) Please write a C++ program that uses both recursive and iterative functions to find the GCD of two numbers. In mathematics, the greatest common divisor (gcd) of two or more integers, when at least one of them is not zero, is the largest positive integer that divides the numbers without a remainder. For example, the GCD of 8 and 12 is 4.

Answer 1

#include <iostream>

using namespace std;

int gcdIteration(int A, int B){
   int result;
   for(int i=1; i <= A && i <= B; ++i)
    {
        if(A%i==0 && B%i==0)
            result = i;
    }
    return result;
}

int gcdRecursive(int A, int B){
    if (B!= 0)
       return gcdRecursive(B, A%B);
    else 
       return A;
}

int main(){    
   int A,B, result;
   cout<<"Enter A: ";
   cin>>A;
   cout<<"Enter B: ";
   cin>>B;
   cout<<"GCD using iterative approach = "<<gcdIteration(A,B)<<endl;
   cout<<"GCD using recursive approach = "<<gcdRecursive(A,B)<<endl;
   return 0;
}