public static int func1(int m, int n)
{
If (m == n || n == 1)
Return 1;
Else
Return func1(m - 1, n - 1) + n * func1(m - 1, n);
}What precondition must exist in order to prevent the code in the accompanying figure from infinite recursion?
A) m = 0 and n = 0
B) m = 0 and n = 1
C) m = 1 and n = 0
D) m = 1 and n = 1

Question

public static int func1(int m, int n)
{
If (m == n || n == 1)
Return 1;
Else
Return func1(m - 1, n - 1) + n * func1(m - 1, n);
}What precondition must exist in order to prevent the code in the accompanying figure from infinite recursion?
A) m >= 0 and n >= 0
B) m >= 0 and n >= 1
C) m >= 1 and n >= 0
D) m >= 1 and n >= 1

Quizplus · Accepted Answer

The Answer of public static int func1(int m, int n)
{
If (m == n || n == 1)
Return 1;
Else
Return func1(m - 1, n - 1) + n * func1(m - 1, n);
}What precondition must exist in order to prevent the code in the accompanying figure from infinite recursion?
A) m >= 0 and n >= 0
B) m >= 0 and n >= 1
C) m >= 1 and n >= 0
D) m >= 1 and n >= 1

Public Static Int Func1(int M, Int N)