Open In App
Related Articles

Data Structures | Linked List | Question 9

Improve Article
Improve
Save Article
Save
Like Article
Like

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



Answer: (D)

Explanation:

In the worst case, the given element may not be present in the singly linked list of length n. Therefore, the search algorithm would need to traverse the entire list to determine that the element is not present.

Therefore, the number of comparisons needed to search a singly linked list of length n in the worst case is equal to n, which is the length of the list.


Quiz of this Question
Please comment below if you find anything wrong in the above post

Feeling lost in the world of random DSA topics, wasting time without progress? It's time for a change! Join our DSA course, where we'll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 geeks!

Last Updated : 28 Jun, 2021
Like Article
Save Article
Previous
Next
Similar Reads
Complete Tutorials