Efficient search of sorted numerical values

Question

I have an int[] array that contains values with the following properties:

• They are sorted
• They are unique (

Answer 1

This is in the comments and should be an answer. It's a joint effort, so I'm making it a CW answer:

You may want to look at an interpolation search. In the worst case, they can be worse than O(log n) and so if that's a hard requirement, this wouldn't apply. But if your interpolation is decent, depending on the data distribution an interpolation search can beat a straight binary.

To know, you'd have to implement the interpolation search with a reasonably smart interpolation algorithm, and then run several representative data sets through both to see whether the interpolation or the binary is better suited. I'd think it'd be one of the two, but I'm not au fait with truly cutting edge searching algorithms.