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 1394 students.
Show answer
Correct answer: D
The worked solution is available to enrolled students.
Video solution available to enrolled students.
Explore the full course: Iocl Engineers Officers Grade A Paper 2
Loading lesson…