Program to find the GCD of two numbers using recursion in C++

Program to find the GCD of two numbers using recursion in C++ Solution : #include <iostream> using namespace std; int GCD(int a,int b) { while(a!=b) { if(a>b) return GCD(a-b,b); else…