This PPT is about the Recursion, if you want to see in detail visit the Be a Programmer channel on YouTube.

1. What is Recursion?

2. The function that calls itself is called as recursive
function and the technique is known as recursion.
Example-: int sample()
{
sample(); //recursion
}

3. int main()
{
printf(“Start”);
main();
printf(“End”);
}
Stack Memory
main()
printf(“Start”);
main();
main()
printf(“Start”);
main();
main()
printf(“Start”);
main();
main()
printf(“Start”);
main();
Execution
Terminated

4. Factorial using
Recursion

5. Stack Memory
if(3==0)
X
else
res=3*fact(2);
return res;
fact(n==3)
if(2==0)
X
else
res=2*fact(1);
return res;
fact(n==2)
if(1==0)
X
else
res=1*fact(0);
return res;
fact(n==1)
if(0==0)
res=1
return res;
fact(n==0)
n=3,res;
fact(3);
Output:6
main()
1
12
6