binary-search.h

算法类

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