Multiple choices 11/50
(Choose 1 answer)
Next
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. then before performing Step 3 of the loop
A. x=35. y=13
B. v=3 x=12y=?
C. x=35. y=16
, y=13 n~v=16
E. None of the other choices is correct
1
2
3
4
5
6
7
8
9
10
11 12 13
14
15
16 17
18
19
20
21
22
23 24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40 41 42
43
44
45 46 47 48
49 50
