C++ program for gcd of two numbers
We can solve this by recursion .
1.The base condition is that if both numbers are same let,s say x and y are equal we return either x or y.
* if x is greater than y we subtract y from x and then again call the function like this
*else if y is greater than x we subtract x from y and then again call the function like this
using namespace std;
int gcd(int n1,int n2)