(Choose 1 answer)
Given the Euclidean algorithm to find the greatest common divisor of two positive integers a
procedure GCD(a, b: positive integers)
y:= b
while y > 0
begin
x:= a r: = x mod y x: = y
y:= r end
{UCLN(a, b) = x}
How many divisions are used to find GCD(201, 111)?
A. 8
B. 5
C. 7
D. 6
E. None of the other choices is correct
E22
