Answers for "factorial recursion algorithm"

factorial recursive

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))

Posted by: Guest on June-26-2021

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))

Posted by: Guest on January-25-2022

Code answers related to "factorial recursion algorithm"