Q224
What is the computational complexity of Binary GCD algorithm where a and b are integers?
A.
O (log a + log b)2)
AnswerB.
O (log (a + b))
C.
O (log ab)
D.
O (log a-b)
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board