InterviewSolution
Saved Bookmarks
| 1. |
The complexity of a linear search algorithm is(a) O(n)(b) O(log n)(c) O(n2)(d) O(n log n)I got this question by my school principal while I was bunking the class.My question is based upon Sorting topic in portion Query Processing Techniques of Database Management |
|
Answer» The correct answer is (a) O(n) |
|