查找之二分查找

#include"stdio.h"
int  binSearch(int *a,int x,int low,int high)
{
      int mid;
      int i,j;
      while(low<=high)
      {
         mid=(low+high)/2;
           if(a[mid]==x)
          {
          return mid;
          }
          else
          {
            if(x<a[mid])
              high=mid-1;
              else
              low=mid+1;
          }
      }

     
}
int main()
{
     int a[100],n,x,i;
        int *y=a;
    scanf("%d %d",&n,&x); //输入数组的个数和要查找的数字
      for(i=0;i<n;i++)
       scanf("%d",&a[i]);
      
      printf("%d", binSearch(y,x,0,n-1) );
      
    return 0;
}