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;
}
-What is returned if factorial(3) is called?
A) 0
B) 1
C) 3
D) 6
E) 9

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;
}
-What is returned if factorial(3) is called?
A) 0
B) 1
C) 3
D) 6
E) 9

Quizplus · Accepted Answer

D) With factorial(3), x > 1, so it returns 3 * factorial(2), with factorial(2), x > 1 so it returns 2 * factorial(1), with factorial(1), 1 is returned, so we have 3 * 2 * 1 = 6.

For the Questions Below, Refer to the Following Recursive Factorial