In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is (GATE CS 2002)
(A)
log(2*n)
(B)
n/2
(C)
log(2*n) -1
(D)
n
Answer: (D)
Explanation:
In the worst case, the given element may not be present in the singly linked list of length n. Therefore, the search algorithm would need to traverse the entire list to determine that the element is not present.
Therefore, the number of comparisons needed to search a singly linked list of length n in the worst case is equal to n, which is the length of the list.
Quiz of this Question
Please comment below if you find anything wrong in the above post