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 problem is that (l+u) is evaluated first, and could overflow int, so (l+u)/2 would return the wrong value.