title: Which of the two is a better for an implementation of binary search?
body: <p>In an array with low and high as indices of left and right boundaries , respectively, following are two ways of finding middle element:</p>
  
  <pre><code>1. int mid = (low+high)/2;
  2. int mid = low + ((high - low) / 2);
  </code></pre>