Calculating mid in binary search

Question

I was reading an algorithms book which had the following algorithm for binary search:

public class BinSearch {
  sta         


        

Answer 1

The potential overflow is in the l+u addition itself.

This was actually a bug in early versions of binary search in the JDK.