If for an algorithm time complexity is given by O(n) then the complexity of it is ___________
(a) constant
(b) linear
(c) exponential
(d) none of the mentioned
This question was addressed to me by my college professor while I was bunking the class.
Enquiry is from Algorithms topic in division Algorithms of Discrete Mathematics