var array = [1, 2, 3, 4, 5, 6];
function search(array, target) {
let left = 0;
let right = array.length - 1;
let middle;
while (left <= right) {
// Math.floor向下取整
middle = Math.floor(left + (right - left) / 2); // 防止栈溢出
if (array[middle] == target) {
return middle;
} else if (array[middle] < target) {
left = middle + 1;
} else {
right = middle - 1;
}
}
return -1;
}
var index = search(array, 6);
console.log(index);
05-14
720

01-17
243

05-21