Question 9890 – Time-Complexity
November 14, 2023Algorithms
November 14, 2023Question 9893 – Time-Complexity
If n is a power of 2, then the minimum number of multiplications needed to compute a* is
Correct Answer: A
Question 7 Explanation:
We require 4 multiplications to calculate a16 …..(I)
→ Like that 3 multiplications requires to calculate a8 …..(II)
I, II are satisfied with the option A.
log2 n
√n
n-1
n