Q66
The worst case running time of a linear search on the self organizing list is . . . . . . . .
A.
O(1)
B.
O(logn)
C.
O(n)
AnswerD.
O(n2)
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board