Join ExamsbookAnswer : 3. "O(n)"
The complexity of linear search algorithm is5
Q: The complexity of linear search algorithm is
- 1O(n2)false
- 2O(n log n)false
- 3O(n)true
- 4O(log n)false
- Show AnswerHide Answer
- Workspace
Answer : 3. "O(n)"
Explanation :
Answer: C) O(n) Explanation: The worst case complexity of linear search is O(n).