Question

The __________ of recursion is the number of times a function calls itself.

Short answer

Answer: Depth

Step-by-step solution

Definition of recursion

Recursion is the process in which a function calls itself as a part of its computation.

Recursion components

A recursive function has two basic components: the base case and the recursive case. - Base case: It is a condition that stops the recursion when met. - Recursive case: This is the part where the function calls itself to solve a smaller version of the problem.

Identifying the term

In a recursive function, the number of times a function calls itself depends on how many recursive steps are taken before reaching the base case. This number of times a function calls itself is referred to as the __________ of recursion. The missing term in the statement is "depth".