二分查找函数

int binsearch(int x,int v[],int n)

{

 int low,high,mid;

 high=n-1;

 low=0;

 while(low<=high)

 {

  mid=(low+high)/2;

  if(x<v[mid])

   high=mid-1;

  else if(x>v[mid])

    low=mid+1;

  else

     return mid;

 }

 return -1;

}

int main()

{

 int a[10]={11,13,16,17,21,31,51,60,70,80};

 if(binsearch(51,a,10)==-1)

  printf("not find\n");

 else

  printf("find it\n");

 

}