Multiple Choice
The recursive factorial function calculates the factorial of its parameter. Its base case is when the parameter is ________.
A) returned
B) received
C) amortized
D) zero
E) None of these
Correct Answer:

Verified
Correct Answer:
Verified
Related Questions
Q1: When recursion is used on a linked
Q3: The QuickSort algorithm is used to sort<br>A)
Q6: A recursive function cannot call another function.
Q7: Like a loop, a recursive function must
Q7: Indirect recursion means that a function calls
Q8: The QuickSort algorithm was developed in 1960
Q11: If a recursive function does not contain
Q15: Recursion can be used to:<br>A)compute factorials<br>B)find GCD's<br>C)traverse
Q17: Recursive algorithms are less efficient than iterative
Q26: The _ of recursion is the number