A recursive step, in which the method calls itself, must ____.
A) include a call to the method
B) be tail-recursive
C) include a binary search algorithm
D) eventually lead to the stopping state

Question

Quizplus · Accepted Answer

A recursive step must eventually lead to the stopping state, where the recursion stops and the method returns a final value. A recursive step does not necessarily need to include a call to the method, as there may be conditions where the recursion stops without further method calls. Tail-recursion is a specific type of recursion where the recursive call is the last action in the method and can be optimized by some compilers. A binary search algorithm is a specific algorithmic approach and not necessary for a recursive step in general.

A Recursive Step, in Which the Method Calls Itself, Must