Question

I am confused on the performance analysis of binarySearch from the Collections

It says:

If the specified list does not implement the RandomAccess interface
and is large, this method will do an iterator-based binary search that
performs O(n) link traversals and O(log n) element comparisons.

I am not sure how to interpret this O(n) + O(log n).

I mean isn’t it worse than simply traversing the linked-list and compare? We still get only O(n).

So what does this statement mean about performance? As phrased, I can not understand the difference from a plain linear search in the linked list.

What am I missunderstanding here?

Answer 1

First of all you must understand that without RandomAccess interface the binarySearch cannot simply access, well, random element from the list, but instead it has to use an iterator. That introduces O(n) cost. When the collection implements RandomAccess, cost of each element access is O(1) and can be ignored as far as asymptotic complexity is concerned.

Because O(n) is greater than O(log n) it will always take precedence over O(log n) and dominate the complexity. In this case binarySearch has the same complexity as simple linear search. So what is the advantage?

Linear search performs O(n) comparisons, as opposed to O(log n) with binarySearch without random access. This is especially important when the constant before O(logn) is high. In plain English: when single comparison has a very high cost compared to advancing iterator. This might be quite common scenario, so limiting the number of comparisons is beneficial. Profit!