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);
}recursion factorial algorithm
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 *)factorial with recursion
function factorialRecursion(n) {
if (n == 1) {
return 1;
}
return n * factorialRecursion(n - 1);
}
console.log(factorialRecursion(5))
//Output: 120factorial recursion
function factorial(n) {
// Base case
if (n === 0 || n === 1) return 1;
// Recursive case
return n * factorial(n — 1);
}recursive factorial of a number
factorial(N){
if(N<=1)
{
return 1;
}
else
{
return (N*factorial(N-1));
}
}factorial using recursion
def fact(n):
if n==0 or n==1:
return 1
else:
return n*fact(n-1)
print(fact(4))
print(fact(3))
print(fact(0))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
