Multiple Choice
If a recursive algorithm 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
Related Questions
Q4: In a recursive solution, the base case
Q5: The recursive factorial function calculates the factorial
Q6: A recursive function cannot call another function.
Q7: Like a loop, a recursive function must
Q8: The QuickSort algorithm was developed in 1960
Q10: The QuickSort algorithm works on the basis
Q11: A _ function is one that calls
Q12: The speed and amount of memory available
Q13: The following code is an example
Q14: Any algorithm that can be coded with