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

Question

Quizplus · Accepted Answer

Recursion can be used to compute factorials by calling the factorial function inside itself with a smaller number. Recursion can also be used to find GCD's through the Euclidean algorithm, which repeatedly divides two numbers until they are equal. Lastly, recursion is often used to traverse linked lists by recursively calling the function on the next node until the end of the list is reached. Therefore, all of these options are valid uses of recursion.

Recursion Can Be Used To