Why does recursion always starts with the problem factorial ?
def factorial(n): assert int(n) == n and n > 0,"Enter a positive integer only if n == 0: #base condition return 1 else: return n*factorial(n - 1) #Recursive case print(factorial(n))
def factorial(n):
assert int(n) == n and n > 0,"Enter a positive integer only
if n == 0: #base condition
return 1
else:
return n*factorial(n - 1) #Recursive case
print(factorial(n))
