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

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 returned from gcd(60, 24)?
A) 60
B) 24
C) 12
D) 66

Quizplus · Accepted Answer

When gcd(60, 24) is called, the algorithm proceeds as follows:
Since x (60) is greater than y (24), we move to the else condition. 
y is not equal to 0, so we return gcd(y, x mod y), which becomes gcd(24, 12). 
We repeat the previous step, and gcd(12, 0) is returned. Since y=0, we return x, which is 12. Therefore, the answer is 12.

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