A factorial method is complete when it generates:
A) a recursive call to the factorial method with the argument 0.
B) an indefinite method.
C) a recursive call to the factorial method with the argument -1.
D) None of these is correct.

Question

Quizplus · Accepted Answer

A factorial method is complete when it generates a recursive call with the argument 0, as 0! is defined to be 1, which serves as the base case for the recursion.

A Factorial Method Is Complete When It Generates