Home » Verbal Reasoning » Arithmetic Reasoning

The complexity of linear search algorithm is

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!
Join Discussion