In the worst case, the number of comparisons needed to search a single linked…
GATE · Computer Science · 2002
In the worst case, the number of comparisons needed to search a single linked list of length n for a given element is
- A.
log n
- B.
n/2
- C.
log₂ n − 1
- D.
n
Attempted by 1542 students.
Sign up free to check your answer
Sign up freeLoading lesson…