Consider the recursive square method shown below that takes a non-negative int argument:
Public int square(int n)
{
Return square(n, n);
}
Public int square(int c, int n)
{
If (c == 1)
{
Return n;
}
Else
{
Return n + square(c - 1, n);
}
}
Assume that the last return statement is changed to this:
Return square(c - 1, n);
What would a call to square(7) return?
A) 7
B) 13
C) 14
D) 49

Question

Quizplus · Accepted Answer

The modified recursive method will return the value of `n` when `c` becomes 1, which is 7 in this case. The recursive call `square(c - 1, n)` without adding `n` will not accumulate the sum, so it will just return `n` when `c` reaches 1.

Consider the Recursive Square Method Shown Below That Takes a Non-Negative