+1 vote
2.3k views

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

1. $O(\log_2 n)$
2. $O(n)$
3. $O(1)$
4. $O(n^2)$
in DS | 2.3k views
0
Assuming we are talking about average case, clearly, option (B).

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.

by Boss (38.7k points)
selected by