For the questions below, refer to the following recursive factorial method.
public int factorial(int x)
{
if (x 1) return x * factorial (x - 1);
else return 1;
}
-How many times is the factorial method invoked if originally called with factorial(5)? Include the original method call in your counting.
A) 1
B) 4
C) 5
D) 6
E) 7

Question

For the questions below, refer to the following recursive factorial method.
public int factorial(int x)
{
if (x > 1) return x * factorial (x - 1);
else return 1;
}
-How many times is the factorial method invoked if originally called with factorial(5)? Include the original method call in your counting.
A) 1
B) 4
C) 5
D) 6
E) 7

Quizplus · Accepted Answer

C) The method is first invoked with factorial(5), which in turn returns 5 * factorial(4), so factorial is invoked again, which in turn returns 4 * factorial(3), so factorial is invoked again, which in turn returns 3 * factorial(2), so factorial is invoked again, which in turn returns 2 * factorial(1), so factorial is invoked again, and finally factorial(1) invokes the base case and returns 1. So, factorial was invoked 5 times.

For the Questions Below, Refer to the Following Recursive Factorial