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);
}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);
}factorial with recursion
function factorialRecursion(n) {
if (n == 1) {
return 1;
}
return n * factorialRecursion(n - 1);
}
console.log(factorialRecursion(5))
//Output: 120recursive factorial of a number
factorial(N){
if(N<=1)
{
return 1;
}
else
{
return (N*factorial(N-1));
}
}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
