In the worst case, the number of comparisons needed to search a singly linked list of length

Question:

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\

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: