Saved Bookmarks
| 1. |
Time complexity of the binary search algorithm is constant.(a) True(b) FalseThe question was asked in an international level competition.My doubt is from Algorithms topic in portion Algorithms of Discrete Mathematics |
|
Answer» CORRECT OPTION is (b) False For EXPLANATION I WOULD say: It is O(log2n), therefore COMPLEXITY will be logarithmic. |
|