binary-search-2.h

算法类

inline int BINARY_SEARCH(int* A,int begin,int end,int v)
{
  if(begin <= end)
    {
      int mid=(begin+end)/2;
      if(v==A[mid])
	return mid;
      else if(v>A[mid])
	return BINARY_SEARCH(A,mid+1,end,v);
      else
	return BINARY_SEARCH(A,begin,mid-1,v);
    }
  return -1;
}