Question

Write a recursive program for finding the GCD between two numbers.

Answer 1

Program to find GCD of two numbers
see the picture

Answer 2

Answer:

#include<iostream>

using namespace std;

int gcd(int a,int b)

{

 int i,n;

 if(a>b)

   n=b;

 else

   n=a;

 for(i=n;i>=1;i--)

 {

   if((a%i==0)&&(b%i==0))

     return i;

 }

}

int main()

{

 int a,b;

 cin>>a>>b;

 cout<<"G.C.D of "<<a<<" and "<<b<<" = "<<gcd(a,b);

 //Type your code here.

}

Explanation: