A recursive solution that finds the factorial of n always reduces the problem size by ______ at each recursive call.
A)1
B)2
C)half
D)one-third

Name: A recursive solution that finds the factorial of n always reduces the problem size by ______ at each recursive call. A)1 B)2 C)half D)one-third
Brand: Quizplus
Rating: 4.9 (33 reviews)

Question

Quizplus · Accepted Answer

A recursive solution for finding the factorial of n (n!) typically involves calling the function itself with the argument n-1, thus reducing the problem size by 1 at each step.

A Recursive Solution That Finds the Factorial of N Always