Scribd
Upload
32 views

23 C++ Recursion

Recursion in C++ occurs when a function calls itself within its own definition. A recursive function is one that calls itself during its execution. Tail recursion is when a function calls itself as its last action before returning, without performing any other computation or task after the recursive call. The example document provides code to calculate the factorial of a number recursively by having the factorial function call itself, multiplying the current number by the factorial of one less than the current number until the base case of 0 is reached.

Uploaded by

Rahul Dubey
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
32 views

23 C++ Recursion

Recursion in C++ occurs when a function calls itself within its own definition. A recursive function is one that calls itself during its execution. Tail recursion is when a function calls itself as its last action before returning, without performing any other computation or task after the recursive call. The example document provides code to calculate the factorial of a number recursively by having the factorial function call itself, multiplying the current number by the factorial of one less than the current number until the base case of 0 is reached.

Uploaded by

Rahul Dubey
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

C++ Recursion

When function is called within the same function, it is known as recursion in C++. The
function which calls the same function, is known as recursive function.

A function that calls itself, and doesn't perform any task after function call, is known as tail
recursion. In tail recursion, we generally call the same function with return statement.

Let's see a simple example of recursion.

1. recursionfunction(){
2. recursionfunction(); //calling self function
3. }

C++ Recursion Example


Let's see an example to print factorial number using recursion in C++ language.

1. #include<iostream>
2. using namespace std;
3. int main()
4. {
5. int factorial(int);
6. int fact,value;
7. cout<<"Enter any number: ";
8. cin>>value;
9. fact=factorial(value);
10. cout<<"Factorial of a number is: "<<fact<<endl;
11. return 0;
12. }
13. int factorial(int n)
14. {
15. if(n<0)
16. return(-1); /*Wrong value*/
17. if(n==0)
18. return(1); /*Terminating condition*/
19. else
20. {
21. return(n*factorial(n-1));
22. }
23. }

Output:

Enter any number: 5


Factorial of a number is: 120

We can understand the above program of recursive method call by the figure given below:

Next Topic C++ Storage Classes

You might also like