recursion function

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…

Program to find Factorial of a number using recursion in C++ Solution #include <iostream> using namespace std; int factorial(int n) { if(n==1) return 1; else return n*factorial(n-1); } int main()…