To solve a program recursively,you need to identify at least one case in which the problem can be solved without recursion - this is known as
A) the recursive case.
B) the terminal case.
C) the base case.
D) the final case.

Question

Quizplus · Accepted Answer

The base case is the condition that allows the recursive function to stop calling itself and return a value. This is essential for the function to stop calling itself and avoid an infinite loop. The other answer choices are not commonly used terms to describe the initial condition of a recursive function.

To Solve a Program Recursively,you Need to Identify at Least