GCD_Rec.cpp

// C++ program to find GCD of two numbers
#include<iostream>
usingnamespacestd;
// Recursive function to return gcd of a and b
intgcd(int a, int b)
{
// Everything divides 0
if (a == 0)
return b;
if (b == 0)
return a;

// base case
if (a == b)
return a;

// a is greater
if (a > b)
returngcd(a-b, b);
returngcd(a, b-a);
}

// Driver program to test above function
intmain()
{
int a = 98, b = 56;
 cout<<"GCD of "<<a<<" and "<<b<<" is "<<gcd(a, b);
return0;
}