Saved Bookmarks
| 1. |
The time complexity of the linear search is given by ___________(a) O(log2n)(b) O(1)(c) exponential(d) none of the mentionedI have been asked this question in semester exam.The query is from Algorithms topic in portion Algorithms of Discrete Mathematics |
|
Answer» The correct ANSWER is (d) none of the mentioned |
|