H466 - Recursion in Python

What is a base case in recursion?

• A condition that causes the function to call itself

• A condition that stops the recursion

• A condition that multiplies the result

• A condition that adds more parameters

Which of the following is a characteristic of a recursive function in Python?

• It uses a loop to iterate over a sequence

• It calls itself with a modified argument

• It always returns a list

• It never returns a value

How does recursion differ from iteration?

• Recursion uses loops, while iteration uses function calls

• Recursion is always faster than iteration

• Recursion uses function calls, while iteration uses loops

• Recursion and iteration are the same

Consider the following recursive function in Python: ```python def factorial(n): if n == 0: return 1 else: return n * factorial(n-1) ``` What is the base case for this function?

Which of the following is an advantage of using recursion over iteration?

• Recursion is easier to understand for problems that have a natural recursive structure

• Recursion always uses less memory than iteration

• Recursion is always faster than iteration

• Recursion never causes stack overflow