php二分查找

时间:2014-02-25 15:47:12   收藏:0   阅读:336
// 递归版本
bubuko.com,布布扣
function bin_sch($arr,$low,$high,$val)
{
  if($low<$high){
                $mid = intval(($low+$high)/2);
                if($val == $arr[$mid]){
                    return $mid; 
                }else if($val < $arr[$mid]){
                     return bin_sch($arr,$low,$mid-1,$val);
                }else{
                    return bin_sch($arr,$mid+1,$high,$val);
                }       
        }
        return -1;
}                        
bubuko.com,布布扣

 

// 非递归版本
 
bubuko.com,布布扣
function bin_sch($arr,$val)
{
     $num = count($arr);
     $low = 0;
     $high = $c - 1;
     while($low <= $high){
          $mid = intval(($low + $high)/2);
          if($val <  $arr[$mid]){
              $mid++;
          }else if($val > $arr[mid]){
              $high--;
          }else{
              return $mid;
         }
     }   
     return -1;
}
bubuko.com,布布扣

 

 

原文:http://www.cnblogs.com/huntaheart/p/3565358.html

评论(0
© 2014 bubuko.com 版权所有 - 联系我们:wmxa8@hotmail.com
打开技术之扣,分享程序人生!