What is the total running time of the binary GCD algorithm? – McqOptions

MCQOPTIONS

1.	What is the total running time of the binary GCD algorithm?
A.	O(N)
B.	O(N2)
C.	O(log N)
D.	O(N log N)
Answer» C. O(log N)

Discussion

No Comment Found

Related MCQs

According to Gabriel lame, how many steps does Euclid's algorithm require to solve a problem?
The dictionary ordering of elements is known as?
Who demonstrated the difference in numerical stability?
What is the total running time of Euclid's algorithm?
What is the time complexity of Heap's algorithm?
Counting intersections can be done using the inclusion-exclusion principle only if it is combined with De Morgan's laws of complementing.
Who discussed techniques for reducing the memory requirements for Strassen's algorithm?
Compute the product matrix using Strassen's matrix multiplication algorithm.Given a11=1; a12=3;a21=5;a22=7 b11=8;b12=4;b21=6;b22=2
Running time of Strassen's algorithm is better than the naïve Theta(n3) method.
Euclidean algorithm does not require the calculation of prime factors.