/*****************
2. Write a recursive function gcd that returns the
greatest common divisor of x and y, which is defined recursively as follows:
If y is equal to 0, then gcd(x,y) is x; otherwise gcd(x,y) is gcd(y, x % y),
where % is the modulus operator.
**************************/

/******************NOTE*****************
The definition of gcd given above is symmetric in x and y; you could interchange the roles of x and y. To test this we have two equivalent gcd() functions given below.


*****************/

#include<iostream>
using namespace std;


int gcd(int x, int y);
int gcd2(int x, int y);

int main(){
  int x, y;
  cout<<"Enter two integers\n";
  cin>>x>>y;
  cout<<"gcd = "<<gcd(x,y)<<endl;
  cout<<"gcd = "<<gcd2(x,y)<<endl; /**gcd() and gcd2()should give identical results ***/
}


int gcd(int x, int y){
  if(y==0)
    return x;
  else
    return gcd(y, x%y);
}

int gcd2(int x, int y){
  if(x==0)
    return y;
  else
    return gcd2(y%x, x);
}