What defines the depth of recursion?
A) The length of the algorithm
B) The numbers of function calls
C) The number of times the function calls itself
D) The number of times it goes back to the main function

Question

Quizplus · Accepted Answer

The depth of recursion is determined by the number of times the function calls itself. Each time the function calls itself, it creates a new stack frame, and the depth of recursion represents the number of nested stack frames. Therefore, the number of times the function calls itself is the defining factor for the depth of recursion.

What Defines the Depth of Recursion