Which of the following methods would properly compute the value of x % y (x mod y) recursively, assuming that x and y are not negative numbers? A) public int recursiveMod(int x, int y) { If (x

Question

Which of the following methods would properly compute the value of x % y (x mod y) recursively, assuming that x and y are not negative numbers?
A) public int recursiveMod(int x, int y)
{
If (x < y) return y;
Else return recursiveMod(x, y - x);
}
B) public int recursiveMod(int x, int y)
{
If (x == y) return 0;
Else return recursiveMod(x - y, y) + 1;
}
C) public int recursiveMod(int x, int y)
{
If (x < y) return x;
Else return recursiveMod(x - y, y) + 1;
}
D) public int recursiveMod(int x, int y)
{
If (x < y) return x;
Else return recursiveMod(x - y, y);
}
E) public int recursiveMod(int x, int y)
{
While (x > y)
X = x - y;
Return x;
}

Quizplus · Accepted Answer

Option D uses the correct logic for computing x % y recursively. The base case checks if x is less than y because any value less than y modulo y will just be the value itself. If x is greater than or equal to y, then we need to subtract y from x until it becomes less than y. The result will be the value of x modulo y. Option A does not use the correct logic and will result in an infinite recursion if x is already less than y. Option B does not handle the case where x is already a multiple of y. Option C returns the wrong value. Option E uses a while loop instead of recursion.

Which of the Following Methods Would Properly Compute the Value