//二分折半查找,必须是对有序序列进行,返回下标
function binarySearch2(arr, value)
{
var first = 0;
var last = arr.length - 1 ;
while(first <= last){
mid = (first + last)>>1;
if(arr[mid] < value){
first = mid + 1;
}
else if(arr[mid] > value){
last = mid - 1;
}else{
return mid;
}
}
return -1;
}
function binarySearch2(arr, value)
{
var first = 0;
var last = arr.length - 1 ;
while(first <= last){
mid = (first + last)>>1;
if(arr[mid] < value){
first = mid + 1;
}
else if(arr[mid] > value){
last = mid - 1;
}else{
return mid;
}
}
return -1;
}