二分查找

int erfen(int *a,int l,int r,int v){        //a为待查找数组，l为下界下标，r为上界下标，v为目标值
 
         int mid;
 
         while(l<=r){
 
                  mid=l+r;
 
                  mid/=2;
 
                  if(a[mid]==v)   return mid;
 
                  else if(a[mid]>v)      r=mid-1;
 
                  else  l=mid+1;
 
         }      
 
         return -1;
 
}