Why does the best recursive method usually run slightly slower than its iterative counterpart?
A)Each recursive method call takes processor time.
B)Multiple recursive cases must be considered.
C)Checking multiple terminating conditions take more processor time.
D)Testing the terminating condition takes longer.

Question

Quizplus · Accepted Answer

Each recursive method call takes some time and adds to the overhead of the program. This can make the recursive method slightly slower than an iterative counterpart.

Why Does the Best Recursive Method Usually Run Slightly Slower