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)
This question was addressed to me by my school principal while I was bunking the class.
The query is from GCD LCM Recursion, in chapter Recursion of Data Structures & Algorithms II