php二分查找-递归与非递归的示例代码分享
$arr[$len-1]){
return false;
}
$start = 0;
$end = $len - 1;
while($start <= $end){
$mid = intval(( $end+$start )/2); //中间值
if($arr[$mid] == $val){
return $mid;
}
if($val < $arr[$mid]){
$end = $mid - 1;
}else{
$start = $mid + 1;
}
}
return false;
}递归实现：
$arr[$len-1]){
return false;
}
if($low <= $high){
$mid = intval( ($low+$high)/2 );
if($arr[$mid] == $key){
return true;
}
$func_name = FUNCTION;
if($key < $arr[$mid]){
return $func_name($arr, $low, $mid-1, $key);
}
else{
return $func_name($arr, $mid+1, $high, $key);
}
}
return false;
} 
