Recursive Method Call Count
Consider the following method.
public int computeSum(int n) {
if (n == 0)
return 0;
else
return n + computeSum(n - 1);
}
If n is a positive integer, what is the total number of times the computeSum method is invoked by the call computeSum(n), including the initial call?
A
2^n
B
n-1
C
n^2
D
n+1
Question Leaderboard
Not enough data yet to show leaderboard.