Question

Write a program to compute GCD of 2 numbers using recursion.

Answer 1

Answer:

#include <iostream>

using namespace std;

int hcf(int n1, int n2);

int main()

{

  int n1, n2;

  cout << "Enter two positive integers: ";

  cin >> n1 >> n2;

  cout << "H.C.F of " << n1 << " & " <<  n2 << " is: " << hcf(n1, n2);

  return 0;

}

int hcf(int n1, int n2)

{

   if (n2 != 0)

      return hcf(n2, n1 % n2);

   else  

      return n1;

}

PLS MARK THE BRAINLIEST.............................