Question
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
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
Answers
There are no human answers yet.
Answered by
GPT 3.5
The code "return (x*factorial(x-1))" reflects the recursive case.
Submit Your Answer
We prioritize human answers over AI answers.
If you are human, and you can answer this question, please submit your answer.