Multiple Choice
Recursion can be used to:
A) compute factorials
B) find GCD's
C) traverse linked lists
D) All of these
E) None of these
Correct Answer:

Verified
Correct Answer:
Verified
Related Questions
Q1: When recursion is used on a linked
Q3: The QuickSort algorithm is used to sort<br>A)
Q6: A recursive function cannot call another function.
Q10: The QuickSort algorithm works on the basis
Q11: If a recursive function does not contain
Q12: The recursive factorial function calculates the factorial
Q17: Recursive algorithms are less efficient than iterative
Q25: When a recursive function directly calls itself,
Q26: The _ of recursion is the number
Q27: When function A calls function B which,