const searchSortArr = ( key, arr ) => {
let low = 0
let high = arr.length - 1
while ( low <= high ) {
let mid = Math.floor((low + high) / 2)
if (key === arr[mid]) {
return true // 元素找到
break
} else if (key > arr[mid]) {
high = mid - 1
} else {
low = mid + 1
}
}
return false
}
let arr1 = [85, 63, 52, 34, 25, 17, 6]
console.log(searchSortArr(6, arr1))