computational time

[jacek]

You can achieve O(logn) complexity in finding an element in a list. But the list has to be presorted first (which in itself of course is O(nlogn)) - then you can use binary search to find the item you need.

You can't use binary search on a list --- it doesn't allow random access.