Recursion in Cpp programming language

In this tutorial, we will discuss recursion in Cpp programming language

A function calling itself is called a recursive function. another word, a function calling from the definition of the same function is known the recursive function and this procedure is known as recursion

Example of recursion function

Recursion in Cpp programming language — Recursive function in Cpp

How recursion works in C++

Recursion in Cpp programming — Recursive function

The flow of the recursive function

The recursion continues until some condition fulfilled

Example

Find factorial of a number using a recursive function in C++

#include <iostream>
#include <conio.h>
using namespace std;
int find_Factorial(int num);
int main()
{
    int num;
    cout<<"Enter the number to find factorial: ";
    cin>>num;
    cout<<"Factorial of" << num<<": "<<find_Factorial(num);
    getch();
    return 0;
}
int find_Factorial(int num)
{
    if(num>1)
        return num*find_Factorial(num-1);
    else
        return 1;
}

When the above code is executed, it produces the following results

Enter the number to find factorial:4
factorial of 4: 24

In the above program, first, find_Factorial() function called inside the main () function with passing its argument.

when the value passed to the function, it is stored in the num variable.

Initially, the value of num is 4 to pass as an argument, then the function calls itself, in it the value of num reduce by 1 and it becomes 3 and it passes to beginning “find_Factorial()” function. it continuously reduces by one in every stage until it comes to 1.

when the num becomes less then 1, here the if condition returns false and flow of control moves to Else part for execution.

Else part is executed, excludes from the function