factorial recursive
#include<stdio.h>
fact(int i, int k){
k=k*i;
i--;
if(i==0){
return k;
}
else{
fact(i, k);
}
}
int main()
{
int k = 1, i, factorial;
scanf("%d",&i);
factorial = fact(i, k);
printf("%d\n",factorial);
return 0;
}
4.33
3
N= int(input())
def fun(n):
if n ==1 or n==0:
return 1
else:
n = n * fun(n-1)
return n
print(fun(N))
Thank you!
3
0
4.33
6
#include <stdio.h>
int factorial(int number){
if(number==1){
return number;
}
return number*factorial(number - 1);
}
int main(){
int a=factorial(5);
printf("%d",a);
}
Thank you!
6
0
4.5
4
//using recursion to find factorial of a number
#include<stdio.h>
int fact(int n);
int main()
{
int n;
printf("Enter the number: ");
scanf("%d",&n);
printf("Factorial of %d = %d", n, fact(n));
}
int fact(int n)
{
if (n>=1)
return n*fact(n-1);
else
return 1;
}
Thank you!
4
0
3.89
9
FUNCTION FACTORIAL (N: INTEGER): INTEGER
(* RECURSIVE COMPUTATION OF N FACTORIAL *)
BEGIN
(* TEST FOR STOPPING STATE *)
IF N <= 0 THEN
FACTORIAL := 1
ELSE
FACTORIAL := N * FACTORIAL(N - 1)
END; (* FACTORIAL *)
Thank you!
9
0
Are there any code examples left?
New code examples in category Other