<分区>
这个代码块工作得很好。这是一个用 javascript 编写的二进制搜索算法。我从一个网站上收集的。
function binarySearch(arr, target) {
let left = 0;
let right = arr.length - 1;
while (left <= right) {
const mid = left + Math.floor((right - left) / 2);
if (arr[mid] === target) {
return mid;
}
if (arr[mid] < target) {
left = mid + 1;
} else {
right = mid - 1;
}
}
return -1;
}
var result = binarySearch([2,3,4,5,6,7,8,9,10],2);
console.log(result);但如果我以这种方式更改 while 循环内的代码，它就不起作用了。 我已经尝试了几次但无济于事。请帮我。有什么问题？
function binarySearch(arr, target) {
let left = 0;
let right = arr.length - 1;
while (left <= right) {
const mid = left + Math.floor((right - left) / 2);
if (arr[mid] === target) {
return mid;
}
if (arr[mid] < target) {
left = mid + 1;
}
// Look here. Here is my problem
if(arr[mid] > target){
right = mid - 1;
}
}
return -1;
}
var result = binarySearch([2,3,4,5,6,7,8,9,10],2);
console.log(result);