Consider the code for the recursive method myPrint shown in this code snippet:
Public static int myPrint(int n)
{
If (n == 0)
{
Return 0;
{
Else
{
Return (n + myPrint(n - 1) ) ;
}
}
To avoid infinite recursion, which of the following lines of code should replace the current terminating case?

Question

Consider the code for the recursive method myPrint shown in this code snippet:
Public static int myPrint(int n)
{
If (n == 0)
{
Return 0;
{
Else
{
Return (n + myPrint(n - 1));
}
}
To avoid infinite recursion, which of the following lines of code should replace the current terminating case?
A) if (n == -1)
B) if (n <= 0)
C) if (n >= 0)
D) The terminating case as shown will avoid infinite recursion.

Quizplus · Accepted Answer

The current terminating case is n == 0, which means that the method will keep calling itself recursively until it reaches 0. This will result in infinite recursion if the input is negative.

To avoid this, we need to change the terminating case to something that will handle negative input. The best choice is (B) if (n <= 0), which will terminate the recursion if the input is zero or negative.

Consider the Code for the Recursive Method MyPrint Shown in This