1.

If for an algorithm time complexity is given by O(log2n) then complexity will be ___________

A. constant
B. polynomial
C. exponential
D. none of the mentioned
Answer» E.


Discussion

No Comment Found

Related MCQs