Multiple Choice
Example Code Ch 12-2
Given the following recursive factorial method:
public int factorial(int x)
{
if (x > 1) return x * factorial (x - 1) ;
else return 1;
}
-Refer to Example Code Ch 12-2: What is returned if factorial(3) is called?
A) 0
B) 1
C) 3
D) 6
E) 9
Correct Answer:

Verified
Correct Answer:
Verified
Related Questions
Q33: It always is possible to replace a
Q34: Explain what a "base case" is in
Q35: Each time the order of a Koch
Q36: Write a recursive method called numSegments(int order)
Q37: A Koch snowflake of order = 1
Q39: Since iterative solutions often use loop variables
Q40: The recursive method to solve the Towers
Q41: Assume a function g(x) is defined as
Q42: Example Code Ch 12-2<br>Given the following recursive
Q43: The following method lacks a base case.<br>public