Page 1 of 1

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

Posted: Thu Jul 14, 2022 9:01 am
by answerhappygod
a) constant
b) polynomial
c) exponential
d) none of the mentioned