Q:

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

belongs to collection: C++ Functions Solved Programs

robaa
Save to bookmark
|
2022-11-26
|
  162 
0

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.

C++ programming, examples, C++ programming examples,
login and add your own answer to this question

All Answers

robaa
2022-11-26
need an explanation for this answer? contact us directly to get an explanation for this answer

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 .

need an explanation for this answer? contact us directly to get an explanation for this answer

total answers (1)

C++ Functions Solved Programs
This question belongs to these collections

Similar questions

need a help?

find thousands of online teachers now
C++ Program to find Power of a Number using Recurs... >>
<< C++ Program to find Prime Numbers between two numb...