Worst case of serial search of finding an element in a linked list
Answers
Answered by
2
Answer:
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
Similar questions