Look at the following pseudocode algorithm: Algorithm gcd(x, y) If (x

Name: Look at the following pseudocode algorithm: Algorithm gcd(x, y) If (x x
Brand: Quizplus
Rating: 4.9 (32 reviews)

Question

Look at the following pseudocode algorithm: Algorithm gcd(x, y)
If (x < y)
Gcd (y, x)
Else
If (y = 0)
Return x
Else
Return gcd(y, x mod y)
End gcd
What is the base case for the algorithm gcd?
A) x < y
B) y == 0
C) x == 0
D) y > x

Quizplus · Accepted Answer

The base case for the algorithm gcd is when y equals 0, as in this case, the algorithm returns the value of x which is the greatest common divisor of x and y.

Look at the Following Pseudocode Algorithm: Algorithm Gcd(x, Y)