Curioustab
Aptitude
General Knowledge
Verbal Reasoning
Computer Science
Interview
Aptitude
General Knowledge
Verbal Reasoning
Computer Science
Interview
Home
»
Verbal Reasoning
»
Arithmetic Reasoning
The complexity of linear search algorithm is
O(n2)
O(n log n)
O(n)
O(log n)
Show Answer
Correct Answer:
O(n)
Explanation:
The worst case complexity of linear search is O(n).
← Previous Question
Next Question→
Discussion & Comments
No comments yet. Be the first to comment!
Name:
Comment:
Post Comment
