Multiple Choice
Suppose that a recursive function with integer parameter n has a base case of 0, and for each non-base case, the function makes a recursive call with argument n+1. If the function is initially called with an actual argument of n = 3, the function call will
A) cause an infinite chain of recursive calls.
B) return after a chain of 2 recursive calls.
C) return after a chain of 3 recursive calls.
D) return after a chain of 4 recursive calls.
E) None of the above
Correct Answer:

Verified
Correct Answer:
Verified
Q1: The base case of a recursive function<br>A)
Q2: The _ algorithm uses recursion to sort
Q3: The quicksort algorithm works on the basis
Q5: A recursive function should be designed to
Q6: A _ function is one that calls
Q7: The programmer must ensure that a recursive
Q8: Recursion can be used to<br>A) compute factorials.<br>B)
Q9: The function int fact(int k)<br>{<br>Return k*fact(k-1);<br>If (k==0)
Q10: The QuickSort algorithm was developed in 1960
Q11: When a function A calls a function