In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is
Q & A › Category: Data Structure › In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is
In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is
a) log2 n
b) n⁄2
c) log2 n – 1
d) n
Admin