How does a recursive factorial function work?

Can you explain how a recursive factorial function works?

Sure! A recursive factorial function calculates the factorial of a number by calling itself with a decremented value until it reaches 1.

What is the factorial of 5 using recursion?

The factorial of 5 is calculated as 5! = 5 × 4 × 3 × 2 × 1, which equals 120.

Can you show me a simple code example of a recursive factorial function?

Absolutely! Here's a simple example in Python:

def factorial(n):
    if n == 0:
        return 1
    else:
        return n * factorial(n - 1)

What are the advantages and disadvantages of using recursion?

Advantages include simplicity and ease of understanding, while disadvantages can be higher memory usage and potential stack overflow for large inputs.