Kizspy | Question: 47
(Choose 1 answer)
Given the Euclidean Algorithm
procedure gcd(a, b: positive integers)
x:= a y:= b while y>0 r:= x mod y x:= y y:= r return x {x is gcd(a, b)}If a=16, b=573, after the second iteration of the loop,
A. x=35, y=13
B. x=13, y=3
C. x=35 y=16
D. x=16, y=13
E. None of the other choices is correct
