In the worst case, the number of comparisons needed to search a singly linked…
GATE · 2002 · CS · Question 1 subparts
In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is:
- A.
log n
- B.
n/2
- C.
log₂ⁿ - 1
- D.
n
Attempted by 1480 students.
Sign up free to check your answer
Sign up freeLoading lesson…