二分查找算法

int binarySearch(int array[],int n,int target)

{

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

while(low<=high)

{

mid=(low+high)/2;

if(array[mid]==target])

return mid;//查找成功

else if(array[mid]<target])

low=mid+1;

else high=mid-1;

}

return -1;//查找失败

}