本文实例讲述了PHP实现的折半查询算法。分享给大家供大家参考，具体如下：
PHP;">
$startIndex){
$searchIndex = ceil(($endIndex - $startIndex) / 2);
}else if($endIndex == $startIndex){
$searchIndex = $endIndex;
}else{
$index = -1;
break;
}
$searchIndex += ($startIndex - 1);
echo '检索范围：'.$startIndex.' ~ '.$endIndex.'
检索位置：'.$searchIndex.'检索值为：'.$data[$searchIndex]; echo '
=======================
'; if($data[$searchIndex] == $x){ $index = $searchIndex; break; }else if($x > $data[$searchIndex]){ $startIndex = $searchIndex + 1; }else{ $endIndex = $searchIndex - 1; } $number++; }while($number < count($data)); return $index; } /* 折半查询算法--使用递归 */ function sSort($data,$x,$startIndex,$endIndex){ if($endIndex > $startIndex){ $searchIndex = ceil(($endIndex - $startIndex) / 2); }else if($endIndex == $startIndex){ $searchIndex = $endIndex; }else{ return -1; } $searchIndex += ($startIndex - 1); echo '检索范围：'.$startIndex.' ~ '.$endIndex.'
检索位置：'.$searchIndex.'检索值为：'.$data[$searchIndex]; echo '
=======================
'; if($data[$searchIndex] == $x){ return $searchIndex; }else if($x > $data[$searchIndex]){ $startIndex = $searchIndex + 1; return sSort($data,$endIndex); }else{ $endIndex = $searchIndex - 1; return sSort($data,$endIndex); } } $data = array(1,3,4,6,9,11,12,13,15,20,21,25,33,34,35,39,41,44); $index = qSort($data,11); // 不用递归的排序方法 $index = sSort($data,count($data) - 1); // 使用递归的排序方法 echo '结果：'.$index;
检索位置：'.$searchIndex.'检索值为：'.$data[$searchIndex]; echo '
=======================
'; if($data[$searchIndex] == $x){ $index = $searchIndex; break; }else if($x > $data[$searchIndex]){ $startIndex = $searchIndex + 1; }else{ $endIndex = $searchIndex - 1; } $number++; }while($number < count($data)); return $index; } /* 折半查询算法--使用递归 */ function sSort($data,$x,$startIndex,$endIndex){ if($endIndex > $startIndex){ $searchIndex = ceil(($endIndex - $startIndex) / 2); }else if($endIndex == $startIndex){ $searchIndex = $endIndex; }else{ return -1; } $searchIndex += ($startIndex - 1); echo '检索范围：'.$startIndex.' ~ '.$endIndex.'
检索位置：'.$searchIndex.'检索值为：'.$data[$searchIndex]; echo '
=======================
'; if($data[$searchIndex] == $x){ return $searchIndex; }else if($x > $data[$searchIndex]){ $startIndex = $searchIndex + 1; return sSort($data,$endIndex); }else{ $endIndex = $searchIndex - 1; return sSort($data,$endIndex); } } $data = array(1,3,4,6,9,11,12,13,15,20,21,25,33,34,35,39,41,44); $index = qSort($data,11); // 不用递归的排序方法 $index = sSort($data,count($data) - 1); // 使用递归的排序方法 echo '结果：'.$index;
运行结果：
更多关于PHP相关内容感兴趣的读者可查看本站专题：《》、《》、《》、《》及《PHP程序设计算法总结》
希望本文所述对大家PHP程序设计有所帮助。
原文链接：https://www.f2er.com/php/16730.html