public function binary_search($int, $array) {
# 将数组排序
sort($array);
# 初始化二分查找的范围
$lower = 0;
$upper = count($array) - 1;
# 进入二分查找流程
while ($lower $int) {
$upper = $middle - 1;
} elseif ($array[$middle] <p> </p><div></div><p>
</p>










