Lists on Data Structure and Algorithms related Questions and Answers


Question :   The worst case running time of a linear search on the self organizing list is ____
1. O(1)
2. O(logn)
3. O(n)
4. O(n2)
Answer :   3 - O(n)  

* Be the First to Post a Comment.

Submit comment :


Captcha Image
Reload

Ask Question

Captcha Image
Reload

Note : Name and Email never shown.





Subscribe


Become a part of EducationForever. Subscribe to our FREE Newsletter