public function binary_search($int, $array) {
# 将数组排序
sort($array);
# 初始化二分查找的范围
$lower = 0;
$upper = count($array) - 1;
# 进入二分查找流程
while ($lower $int) {
$upper = $middle - 1;
} elseif ($array[$middle] < $int) {
$lower = $middle + 1;
} else {
return true;
}
}
return false;
}
![[Web front-end] Node.js quick start](https://img.php.cn/upload/course/000/000/067/662b5d34ba7c0227.png)
