Consider the following recursive code snippet:
Public int mystery(int n, int m)
{
If (n == 0)
{
Return 0;
}
If (n == 1)
{
Return m;
}
Return m + mystery(n - 1, m) ;
}
What parameter values for n would cause an infinite recursion problem in the following method?

Question

Consider the following recursive code snippet:
Public int mystery(int n, int m)
{
If (n == 0)
{
Return 0;
}
If (n == 1)
{
Return m;
}
Return m + mystery(n - 1, m);
}
What parameter values for n would cause an infinite recursion problem in the following method?
A) n == 0
B) n == 1
C) all n with n < 0
D) all n with n >= 0

Quizplus · Accepted Answer

Since the base case for the recursion is when n equals 0, any negative value for n will lead to an infinite recursion as the function will keep subtracting 1 from n until it reaches the base case, which will never happen for negative values. Therefore, option C is the correct choice.

Consider the Following Recursive Code Snippet