Multiple Choice
If a recursive function does not contain a base case, it ________.
A) returns 0 and stops
B) returns false and stops
C) uses up all available stack memory, causing the program to crash
D) reaches the recursive case and stops
E) None of these
Correct Answer:
Verified
Correct Answer:
Verified
Q1: When recursion is used on a linked
Q6: A recursive function is designed to terminate
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
Q12: The recursive factorial function calculates the factorial
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