The document shows the recursive calculation of a factorial function. It displays the step-by-step calculation of 4! through nested function calls. Each level of the recursion calculates the factorial of the current number by multiplying it by the factorial of the previous number until the base case of 1 is reached.

1. Data Structure
Function call

2. Function call

3. Function call
L1

4. Function call
P1
A1
L1

5. Function call
L2
P1
A1
L1

6. Function call
P2
A2
L2
P1
A1
L1

7. Function call
L3
P2
A2
L2
P1
A1
L1

8. Function call
P3
A3
L3
P2
A2
L2
P1
A1
L1

9. Function call
L4
P3
A3
L3
P2
A2
L2
P1
A1
L1

10. Function call
L4
P3
A3
L3
P2
A2
L2
P1
A1
L1

11. Function call
L3
P2
A2
L2
P1
A1
L1

12. Function call
L3
P2
A2
L2
P1
A1
L1

13. Function call
L2
P1
A1
L1

14. Function call
L2
P1
A1
L1

15. Function call
L1

16. Function call
L1

17. int fact(int n) 4 3 2 1
{
if(n == 1)
return(1);
return (n * fact(n - 1));
}
return (4 * fact(3));
return (3 * fact(2));
return (2 * fact(1));
return 1;

18. int fact(int n) 4 3 2 1
{
if(n == 1)
return(1);
return (n * fact(n - 1));
}
return (4 * fact(3));
return (3 * fact(2));
return (2 * fact(1));
return 1;

19. int fact(int n) 4 3 2
{
if(n == 1)
return(1);
return (n * fact(n - 1));
}
return (4 * fact(3));
return (3 * fact(2));
return (2 * 1);

20. int fact(int n) 4 3
{
if(n == 1)
return(1);
return (n * fact(n - 1));
}
return (4 * fact(3));
return (3 * 2);

21. int fact(int n) 4
{
if(n == 1)
return(1);
return (n * fact(n - 1));
}
return (4 * 6);