In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is?
Posted: Wed Jul 13, 2022 7:41 pm
a) log 2 n
b) n⁄2
c) log 2 n – 1
d) n
b) n⁄2
c) log 2 n – 1
d) n
Accurate answers. Every time.
https://answerhappy.com/