int binarySearch(int *myNums, int cnt, int val)
{
  int half = cnt / 2; int *aPoint = &myNums[half];

  if (*aPoint > val)
    {
      int x = binarySearch(&myNums[half],half+1,val);
      aPoint=(myNums[half])[x];
    }

    if (*aPoint < val)
      {
        int y = binarySearch(&myNums[half],half-1,val);
        aPoint=(myNums[half])[-y];
      }

  if (*aPoint != val)
    {
      cout << "not in Array" << endl;
      return -1;
    }
  return half;
}