折半查找的php实现

$num = 12;
//$num = trim(fgets(STDIN));
$arr = [12,56,23,34,24,58,96,67,35,69];
sort($arr);
//var_dump($arr);


$min = 0;
$max = count($arr) - 1;


$found = false;


if($num<$arr[$max] || $num>$arr[$min])
{
while($max>=$min)
{
$index = intval(($min + $max) /2);
if($arr[$index] == $num)
{
$found = true;
echo "the number you find is found," . "its position is " . ($index+1); 
break;
}
if($arr[$index]>$num)
{
$max = $index - 1;
}
if($arr[$index]<$num)
{
$min = $index + 1;
}
}
}


if(!$found)
{
end:
echo "not found";
}