function binarySearch(arr, val){
var low = 0, high = arr.length-1,mid=0;
while(low<=high){
mid = Math.floor( (low + high) / 2);
if(arr[mid] == val){
return mid;
}
else if(arr[mid] > val){
high = mid - 1;
}
else{
low = mid + 1;
}
}
return -1;
}
alert(binarySearch([1,2,5,7,8,9,11],18));
js 二分法查找
最新推荐文章于 2024-05-09 15:45:34 发布