public static int func2(int m, int n)
{
If (n == 0)
Return 0;
Else
Return m + func2(m, n - 1);
}What is the limiting condition of the code in the accompanying figure?
A) n = 0
B) m n
C) m = 0
D) n m

Question

public static int func2(int m, int n)
{
If (n == 0)
Return 0;
Else
Return m + func2(m, n - 1);
}What is the limiting condition of the code in the accompanying figure?
A) n >= 0
B) m > n
C) m >= 0
D) n > m

Quizplus · Accepted Answer

The limiting condition of the code is when n becomes equal to 0 because it is the base case and it stops the recursion. Therefore, the condition that holds true throughout the recursion is n >= 0.

Public Static Int Func2(int M, Int N)