In the worst case, the number of comparisons needed to search

Home » Programming & Data Structure » Programming and data structure miscellaneous » Question

In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is

1. log n
2. n
  2
3. log ₂ ^{(n - 1)}
4. n

Correct Option: D

Worst case of searching occurs when the element to be searched is at the end of the list so no. of comparisons required to search complete list would be n. Hence (d) is correct option.