the following code is for python function to represent a recursive function to find the factorial of an ineger

def factorial(x):
if x==1:
return 1
else: return (x*factorial(x-1))
num=3
print("the factorial of ", num, "is", factorial(num))
which code reflects the recursive case

1 answer

The code "return (x*factorial(x-1))" reflects the recursive case.