Practical 8(Factorial)
Practical 8(Factorial)
fact = fact * i
i = i++
Flowchart:
Result: In this way we have implemented a program to calculate the
factorial of any given number using recursion.
Name -
PRN-
Branch-
#include <stdio.h>
int factorial(int);
int main()
{
int num;
int result;
printf("Enter a number to find it's Factorial: ");
scanf("%d", &num);
if (num < 0)
{
printf("Factorial of negative number not possible\n");
}
else
{
result = factorial(num);
printf("The Factorial of %d is %d.\n", num, result);
}
return 0;
}
int factorial(int num)
{
if (num == 0 || num == 1)
{
return 1;
}
else
{
return(num * factorial(num - 1));
}
}
Output:
Name -
PRN-
Branch-
def recur_factorial(n):
if n == 1:
return n
else:
return n*recur_factorial(n-1)