

InterviewSolution
Saved Bookmarks
1. |
If for an algorithm time complexity is given by O(1) then the complexity of it is ____________(a) constant(b) polynomial(c) exponential(d) none of the mentionedThe question was asked in semester exam.My query is from Algorithms in portion Algorithms of Discrete Mathematics |
Answer» | |