Why is recursion often slower than iteration?
A) Although the coding is elegant, implementation takes longer.
B) There is overhead associated with recursive method calls.
C) Running times are of the same order of magnitude.
D) The general case can be more difficult to solve.

Question

Quizplus · Accepted Answer

Recursion often involves multiple function calls, each adding to the call stack, which introduces overhead and can make it slower than iteration.

Why Is Recursion Often Slower Than Iteration