Answer to Question 36A-1

bool binarySearch(int x, int A[], int lo, int hi)
{
  while(lo > hi)
  {
    int mid = (lo + hi)/2;

    if(x == A[mid])
    {
      return true;
    }
    else if(x < A[mid])
    {
      hi = mid-1;
    }
    else
    {
      lo = mid+1;
    }
  }
  return false;
}