Consider the recursive square method shown below. It takes a non-negative int argument. Then it recursively adds the number n to itself n times to produce the square of n. Complete the correct code for the square helper method.
Public int square(int n)
{
____________________;
}
Public int square(int c, int n)
{
If (c == 1)
{
Return n;
}
Else
{
Return n + square(c - 1, n);
}
}
A) return square(n, n)
B) return square(n)
C) return square(n - 1, n)
D) return square(n, n - 1)

Question

Quizplus · Accepted Answer

The correct implementation for the square method is to call the square helper method with the arguments (n, n), which will recursively add n to itself n times to produce the square of n. Therefore, the correct code for square(int n) is "return square(n, n)".

Consider the Recursive Square Method Shown Below