title: Is it possible to have only one comparison per iteration of a binary search algorithm?
body: <p>In binary search algorithm we have two comparisons:</p>
  
  <pre><code>if (key == a[mid]) then found;
  
  else if (key &lt; a[mid]) then binary_search(a[],left,mid-1);
        else binary_search(a[],mid+1,right);
  </code></pre>
  
  <p>Is there a way by which I can have only one comparison instead of the above two.</p>
  
  <p>--</p>
  
  <p>Thanks</p>
  
  <p>Alok.Kr. </p>