Most Popular Tutorials
-
What is C
-
History of C
-
Feature of C
-
How to Install C
-
How to write c programs
-
First c program
-
Flow of C program
-
printf() and scanf() in C
-
C Program Structure
-
Variables in C
-
Data Types in C
-
Keywords
-
Operators
-
Comments
-
C - Storage Classes
-
Escape Sequence
-
Decision Making
-
Switch statement
-
C Loops
-
Loop Control Statements, loop statement, what is loop
-
Type Casting in C
-
FUNCTION
-
Call by value and call by reference
-
Recursion
-
Array
-
String
-
Pointer
-
Pointer Array
-
Structure
-
Union
-
File Handling
what is 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 know as tail recursion. In tail recursion, we generally call the same function with return statement. An example of tail recursion is given below.
recurfun(){
recurfun();//calling self function
}
recurfun();//calling self function
}
Example of tail recursion in C :-
#include<stdio.h>
int factorial (int n)
{
if ( n < 0)
return -1; /*Wrong value*/
if (n == 0)
return 1; /*Terminating condition*/
return (n * factorial (n -1));
}
int main(){
int fact=0;
fact=factorial(5);
printf("\n factorial of 5 is %d",fact);
return 0;
}
int factorial (int n)
{
if ( n < 0)
return -1; /*Wrong value*/
if (n == 0)
return 1; /*Terminating condition*/
return (n * factorial (n -1));
}
int main(){
int fact=0;
fact=factorial(5);
printf("\n factorial of 5 is %d",fact);
return 0;
}
Output :-
factorial of 5 is 120
Output :-
factorial of 5 is 120
Previous Next
Trending Tutorials
Review & Rating
0.0 / 5
0 Review
5
(0)
4
(0)
3
(0)
2
(0)
1
(0)