有序顺序存储线形表的二分法查找

int binary(int x,int a[],int N)

{

       int low=0,high=N-1,mid;

      

       while(low<=high)

       {

              mid=(low+high)/2;

 

              if(x<a[mid])

                     high=mid-1;

              else

                     if(x>a[mid])

                            low=mid+1;

                     else

                            return mid;           

       }

      

       return -1;

}