Capgemini
Company
Programming
Database
In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is
a) log 2 n b) n/2 c) log 2 n 1 d) n
Read Solution (Total 1)
-
- option d) n
- 4 years agoHelpfull: Yes(0) No(0)
Capgemini Other Question