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
This question was addressed to me during an interview.
I need to ask this question from Algorithms in section Algorithms of Discrete Mathematics