[Solved] The worst case running time of a linear search on the self organizing list is ____

The worst case running time of a linear search on the self organizing list is ____

a) O(1)
b) O(logn)
c) O(n)
d) O(n2)

Answer: c
Explanation: Worst case occurs when the element is located at the very end of the list. So n comparisons must be made to the locate element. So the worst-case running time of linear search on a self-organizing list is O(n).

Comments