Computational Thinking and Recursion Quick Check 4 of 54 of 5 Items Question When performing a recursion, how do you describe the act of a function calling itself?(1 point) Responses backward phase backward phase recursive case recursive case base case base case forward phase forward phase Skip to navigation page 14 of 14

Answer 1

The correct response to describe the act of a function calling itself in recursion is "recursive case."

In the context of recursion:

• The recursive case is when the function calls itself to solve a smaller instance of the same problem.
• The base case is a condition under which the recursion stops, preventing infinite calls.

So, when a function is calling itself, it's executing the "recursive case."