Question

Q: find the big(o) and correctness, 3 sample cases. for the following three algorithms Algorithm 1: gcd(a, b) Input: Two integers a and b Result: The greatest common divisor of a and b if a == b then return a else if a > b then return gcd(a - b, b) else return gcd(a, b - a) end Algorithm 2: gcd(a, b) Input: Two integers a and b Result: The greatest common divisor of a and b if b == 0 then return a else r \<-- a mod b return gcd(b, r) end Algorithm 3: gcd(a, b) Input: Two integers a and b Result: The greatest common divisor of a and b while b != 0 do r \<-- a mod b a \<-- b b \<-- r end return a

          Q: find the big(o) and correctness, 3 sample cases. for
the following three algorithms
Algorithm 1: gcd(a, b)
Input: Two integers a and b
Result: The greatest common divisor of a and b
if a == b then
return a
else if a > b then
return gcd(a - b, b)
else
return gcd(a, b - a)
end
Algorithm 2: gcd(a, b)
Input: Two integers a and b
Result: The greatest common divisor of a and b
if b == 0 then
return a
else
r \<-- a mod b
return gcd(b, r)
end
Algorithm 3: gcd(a, b)
Input: Two integers a and b
Result: The greatest common divisor of a and b
while b != 0 do
r \<-- a mod b
a \<-- b
b \<-- r
end
return a

Q: find the big(o) and correctness, 3 sample cases. for
the following three algorithms
Algorithm 1: gcd(a, b)
Input: Two integers a and b
Result: The greatest common divisor of a and b
if a == b then
return a
else if a > b then
return gcd(a - b, b)
else
return gcd(a, b - a)
end
Algorithm 2: gcd(a, b)
Input: Two integers a and b
Result: The greatest common divisor of a and b
if b == 0 then
return a
else
r – a mod b
return gcd(b, r)
end
Algorithm 3: gcd(a, b)
Input: Two integers a and b
Result: The greatest common divisor of a and b
while b != 0 do
r – a mod b
a – b
b – r
end
return a

Added by Jared J.

Question

Please give Ace some feedback