function binarySearch(arr: number[], item: number):number {
let low = 0;
let high = arr.length - 1;
while (low <= high) {
let mid = (low + high) / 2 << 0;
const guess = arr[mid];
if (guess == item) {
return mid;
} else if (guess > item) {
high = mid - 1;
} else {
low = mid + 1;
}
}
return -1;
}
const index = binarySearch([1, 2, 3, 4, 5, 6], 6);
console.log(index);
时间复杂度:o(log n)