ISRO2008-71

Question

The time required to search an element in a linked list of length n is

• A. $O(\log_2 n)$
• B. $O(n)$
• C. $O(1)$
• D. $O(n^2)$

Comments

Assuming we are talking about average case, clearly, option (B).

Answer 1

The time required to search an element in a linked list of length n is O(n).

In the worst case, the element to be searched has to be compared with all elements of linked list.

Option B is correct.