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

By | 27.12.2016

GCD of two numbers using recursion


Write a C++ Program to find GCD of two numbers using recursion. Here’s simple C++ Program to find GCD(HCF) of two numbers using recursion in C++ Programming Language.


What are Functions ?


Function is a block of statements that performs some operations. All C++ programs have at least one function – function called “main()”. This function is entry-point of your program.

A function declaration tells the compiler about a function’s name, return type, and parameters. A function definition provides the actual body of the function.


Defining a Function : :


The general form of a C++ function definition is as follows:

return_type Function_Name( list of parameters )
{
//function’s body
}

  • return_type : suggests what the function will return. It can be void, int, char, some pointer or even a class object.
  • Function_Name : is the name of the function, using the function name it is called.
  • Parameters : are variables to hold values of arguments passed while function is called. A function may or may not contain parameter list.
  • Function body : is he part where the code statements are written.

Below is the source code for C++ Program to find GCD of two numbers using recursion which is successfully compiled and run on Windows System to produce desired output as shown below :


SOURCE CODE : :


/*  C++ Program to find GCD of two numbers using recursion  */

#include <iostream>
using namespace std;

int hcf(int n1, int n2);

int main()
{
   int n1, n2;

   cout << "\nEnter 1st positive integer :: ";
   cin >> n1;
    cout << "\nEnter 2nd positive integer :: ";
   cin >> n2;

   cout << "\nGCD of Two Numbers [ " << n1 << " & " <<  n2 << " ] is :: " << hcf(n1, n2)<<"\n";

   return 0;
}

int hcf(int n1, int n2)
{
    if (n2 != 0)
       return hcf(n2, n1 % n2);
    else
       return n1;
}

OUTPUT : :


/*  C++ Program to find GCD of two numbers using recursion  */

Enter 1st positive integer :: 14

Enter 2nd positive integer :: 46

GCD of Two Numbers [ 14 & 46 ] is :: 2

Process returned 0

Above is the source code for C++ Program to find GCD of two numbers using recursion which is successfully compiled and run on Windows System.The Output of the program is shown above .

If you found any error or any queries related to the above program or any questions or reviews , you wanna to ask from us ,you may Contact Us through our contact Page or you can also comment below in the comment section.We will try our best to reach up to you in short interval.


Thanks for reading the post….

3.6 5 votes
Article Rating
Category: C++ Programming Functions Programs Tags:

About Tunde A

My name is Tunde Ajetomobi, a Tech Enthusiast and Growth Hacker. I enjoy creating helpful content that solves problem across different topics. Codezclub is my way of helping young aspiring programmers and students to hone their skills and find solutions on fundamental programming languages.

Subscribe
Notify of
guest

0 Comments
Inline Feedbacks
View all comments