A recursive method must have a well-defined ____.
A) factorial
B) recursive step
C) stopping state
D) stack

Question

Quizplus · Accepted Answer

A recursive method must have a well-defined stopping state, which serves as the base case for the recursion to eventually terminate. The other choices are not necessary components of a recursive method, although a factorial calculation can be implemented recursively. A recursive step is simply the process of calling the method within itself, and a stack is used to keep track of multiple recursive calls.

A Recursive Method Must Have a Well-Defined ____