# ISRO2008-71

1 vote
4.7k 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
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.

selected by

## Related questions

1
6.2k views
Which of the following operations is performed more efficiently by doubly linked list than by linear linked list? Deleting a node whose location is given Searching an unsorted list for a given item Inserting a node after the node with a given location Traversing the list to process each node