二分查找（递归实现）

<?php
function binary ($arr,$low,$high,$element)
{
if ($low <= $high)
{
$mid = floor(($low+$high)/2);
if ($arr[$mid] ==$element)
{
return $mid;
} elseif ($arr[$mid] < $element)
{
return binary ($arr,$mid+1,$high,$element);
} else
{
return binary ($arr,$low,$mid-1,$element);
}
} else 
{
return 'No';
}
}


$a = [2,4,6,8,10];
echo binary ($a,0,count($a)-1,8);