1.

What is the computational complexity of Binary GCD algorithm where a and b are integers?

A. o (log a + log b)2)
B. o (log (a + b))
C. o (log ab)
D. o (log a-b)
Answer» B. o (log (a + b))


Discussion

No Comment Found

Related MCQs