//数组元素从小到大排列 乱序应先排序
//二分查找的实现 适用于有序数组 O(log2n)
int binarySearch(int *arr,int len,int a)
{
int low,high,mid;
high = len - 1;
low = 0;
while (low<=high) {
mid = (low+high)/2;
if (arr[mid]<a) {
low = mid+1;
}else if (arr[mid]>a)
{
high = mid -1;
}else{
return mid;
}
}
return -1;
}