c++ recursion gcd code example

Example 1: gcd recursion c++

int gcd(int a, int b){
   if(b==0)
      return a;
    return gcd(b, a % b);
}

Example 2: greatest common denominator recursion c++

#include <iostream>
using namespace std;
int gcd(int a, int b) {
   if (b == 0)
   return a;
   return gcd(b, a % b);
}
int main() {
   int a , b;
   cout<<"Enter the values of a and b: "<<endl;
   cin>>a>>b;
   cout<<"GCD of "<< a <<" and "<< b <<" is "<< gcd(a, b);
   return 0;
}