Answer: factorial(n) returns 1 when n ≤ 1, otherwise n × factorial(n − 1).
Logic: \( 5! = 5 \times 4! = 5 \times 4 \times 3! = \dots = 120 \). The base case n ≤ 1 stops the recursion.
Program:
#include <stdio.h>
long factorial(int n)
{
if (n <= 1)
return 1; /* base case: 0! = 1! = 1 */
return n * factorial(n - 1); /* recursive call */
}
int main()
{
int n;
printf("Enter a number: ");
scanf("%d", &n);
if (n < 0)
printf("Factorial of a negative number is not defined\n");
else
printf("Factorial of %d = %ld\n", n, factorial(n));
return 0;
}Sample output (actual run):
Enter a number: 5
Factorial of 5 = 120