search(arr,target){
//二分搜索:
let count = 1;
let start = 0;
let end = arr.length - 1;
while(start < = end){
//取出中间值
let middle = Math.floor((start + end)/2);
let guess = arr[middle];
//如果中间 == 目标值
if(guess == target){
return middle;//返回位置
}
if(guess>target){
end = middle;
}
if(guess < target){
start = middle+1
}
count++
}
return -1;
}
【二分搜索】
最新推荐文章于 2024-06-13 10:13:20 发布