McqMate
| Q. |
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» A. o (log a + log b)2) | |
| Explanation: from the binary gcd algorithm, it is found that the computational complexity is o (log a + log b)2) as the total number of steps in the execution is at most the total sum of number of bits of a and b. | |
View all MCQs in
Design and Analysis of AlgorithmsNo comments yet