GK Question

technology medium true_false

Recursion always uses less memory than iteration for solving the same problem.

  1. True
  2. False

Answer: False

Recursion typically uses MORE memory due to call stack overhead for each recursive call. Risk of stack overflow for deep recursion. Iteration uses constant memory with loops. However, recursion can simplify code for tree/graph problems, divide-and-conquer algorithms. Tail recursion optimization (in some languages) can mitigate memory issues.

Topic Programming Logic
Exam Relevance SSC JE, Banking IT, Railway