title: what's the difference between mid=(beg+end)/2 and mid=beg+(end-beg)/2 in binary search?
body: <p>It is a problem from C++ primer fifth edition problem 3.26, I don't know the difference between them ?
  May be the second one can avoid overflow.</p>