rekurencja czynnikowa
function factorial(n) {
// Base case
if (n === 0 || n === 1) return 1;
// Recursive case
return n * factorial(n — 1);
}
Quaint Quoll
function factorial(n) {
// Base case
if (n === 0 || n === 1) return 1;
// Recursive case
return n * factorial(n — 1);
}# Factorial of a number using recursion
def recur_factorial(n):
if n == 1:
return n
else:
return n*recur_factorial(n-1)
num = 6
# check if the number is negative
if num < 0:
print("Sorry, factorial does not exist for negative numbers")
elif num == 0:
print("The factorial of 0 is 1")
else:
print("The factorial of", num, "is", recur_factorial(num))