Multiple Choice
Recursion can be used to
A) compute factorials.
B) find the greatest common divisor of two integers (GCD) .
C) program things that cannot be programmed without recursion.
D) All of the above
E) Both A and B, but not C
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
Q3: The quicksort algorithm works on the basis
Q4: Suppose that a recursive function with integer
Q5: A recursive function should be designed to
Q6: A _ function is one that calls
Q7: The programmer must ensure that a recursive
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
Q12: The _ of recursion is the number
Q13: Any algorithm that can be coded with