Multiple Choice
When a function A calls a function B, which in turn calls A, we have
A) direct recursion.
B) indirect recursion.
C) function call cycling.
D) perfect recursion.
E) None of the above
Correct Answer:

Verified
Correct Answer:
Verified
Related Questions
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
Q12: The _ of recursion is the number
Q13: Any algorithm that can be coded with
Q14: The speed and amount of memory available
Q15: Indirect recursion means that a function calls
Q25: When a recursive function directly calls itself,