fastread homefastrread library fastread menu

C++ : Find G.C.D Using Recursion

Tutorial by:Manisha Dubey      Date: 2016-06-18 04:33:17

❰ Previous Next ❱

This program takes two positive integers from user and calculates GCD using recursion. 

Source code to Calculate H.C.F using recursion


/* Example to calculate GCD or HCF using recursive function. */

#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;
}

Output

Enter two positive integers: 366 60
H.C.F of 366 and 60 is: 6

❰ Previous Next ❱


C++

Submit Your Thought, Tutorial, Articls etc.

Submit Your Information India's Number one online promotion website