What is wrong with the following recursive sum method? The method is supposed to sum up the values between 1 and x (for instance, sum(5)should be 5 + 4 + 3 + 2 + 1 = 15). public int sum(int x)
{
If (x == 0) return 0;
Else return sum(x - 1) + x;
}
A) The base case should return 1 instead of 0.
B) The recursive case should return sum(x - 1) + 1 instead ofsum(x - 1) + x.
C) The base case condition should be (x

Question

What is wrong with the following recursive sum method? The method is supposed to sum up the values between 1 and x (for instance, sum(5)should be 5 + 4 + 3 + 2 + 1 = 15). public int sum(int x)
{
If (x == 0) return 0;
Else return sum(x - 1) + x;
}
A) The base case should return 1 instead of 0.
B) The recursive case should return sum(x - 1) + 1 instead ofsum(x - 1) + x.
C) The base case condition should be (x <= 0) instead of (x == 0).
D) The recursive case should return sum(x) + 1.
E) The method should return a boolean instead of an int.

Quizplus · Accepted Answer

The recursive case should return sum(x - 1) + 1 instead of sum(x - 1) + x because x is already being added in the final step of the recursion. Otherwise, the method will always add x twice, once in the last recursive call and once in the return statement.

What Is Wrong with the Following Recursive Sum Method? the Method