Although this question is 5 years old, but there is a great article in googleblog which explains the problem and the solution in detail which is worth to share.
It’s needed to mention that in current implementation of binary search in Java mid = lo + (hi - lo) / 2 calculation is not used, instead the faster and more clear alternative is used with zero fill right shift operator
int mid = (low + high) >>> 1;