computation of mid in binary search
the mid of range [low, high] where low and high define the search space, we apply binary search can be computed using formula
mid = low + high / 2
But this fails if sum of low and high exceeds 2^31-1. The resultant sum overflows to a negative value. This might result in unpredictable resutls or Index out of bound error.