二分查找

int binarySearch(int *data,int low,int high,int value){
if (data==NULL||low<0||low>high)
{
return -1;
}

while (low<=high)
{
int mid=(low+high)>>1;
if (data[mid]==value)
{
return mid;
}
else if (data[mid]>value)
{
high=mid-1;
}
else
{
low=mid+1;
}
}
return -1;
}