Askmeabout

Lets share our knowledge

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

Q & A › Category: Data Structure › The worst case running time of a linear search on the self organizing list is ____
0 Vote Up Vote Down
Admin Staff asked 4 years ago

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)

1 Answers
0 Vote Up Vote Down
Admin Staff answered 4 years ago

c) O(n)