Curioustab
Aptitude
General Knowledge
Verbal Reasoning
Computer Science
Interview
Aptitude
General Knowledge
Verbal Reasoning
Computer Science
Interview
Home
»
Technical Questions
»
Database
The time complexity of sequential search is
O(n)
O(2n)
O(n^2)
None
Show Answer
Correct Answer:
O(n)
Explanation:
The time complexity of sequential search is O(n)
← Previous
Next →
Discussion & Comments
No comments yet. Be the first to comment!
Name:
Comment:
Post Comment
