Recursion is memory-intensive because:
A) Recursive functions tend to declare many local variables.
B) Previous function calls are still open when the function calls itself and the activation records of these previous calls still occupy space on the call stack.
C) Many copies of the function code are created.
D) It requires large data values.

Question

Quizplus · Accepted Answer

Recursion involves multiple function calls being stacked on top of each other, with each call not completing until the ones before it also finish. This means that the activation records for all the previous function calls are still open and occupying space on the call stack, which can quickly become memory-intensive with a large number of recursive calls.

Recursion Is Memory-Intensive Because