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 answer is A. The square helper method takes two arguments: c and n. The c argument represents the number of times that n should be added to itself. The n argument represents the number that is being squared. The base case of the recursion is when c is equal to 1. In this case, the method simply returns n. Otherwise, the method recursively calls itself with c - 1 and n + n. This process continues until the base case is reached.

Consider the Recursive Square Method Shown Below