Example Code Ch 12-1
Given the following recursive method:
public int question1_2(int x, int y)
{
if (x == y) return 0;
else return question1_2(x-1, y) + 1;
}
-Refer to Example Code Ch 12-1: Calling this method will result in infinite recursion if which of the following conditions is initially true?

Question

Example Code Ch 12-1
Given the following recursive method:
public int question1_2(int x, int y)
{
if (x == y) return 0;
else return question1_2(x-1, y) + 1;
}
-Refer to Example Code Ch 12-1: Calling this method will result in infinite recursion if which of the following conditions is initially true?
A) (x == y)
B) (x != y)
C) (x > y)
D) (x < y)
E) (x == 0) && (y != 0)

Quizplus · Accepted Answer

If x is initially less than y, the method will keep calling itself with decreasing x, never reaching the base case where x equals y, resulting in infinite recursion.