factorial recursion javascript
function factorial(n){
if(n<=1){
return 1;
}else{
var result = 1;
result = factorial(n-1) * n;
}
return result;
}factorial recursion javascript
function factorial(n){
if(n<=1){
return 1;
}else{
var result = 1;
result = factorial(n-1) * n;
}
return result;
}factorial of number using recursion
//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;
}Factorial of a number using recursion
#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);
}Copyright © 2021 Codeinu
Forgot your account's password or having trouble logging into your Account? Don't worry, we'll help you to get back your account. Enter your email address and we'll send you a recovery link to reset your password. If you are experiencing problems resetting your password contact us
