在线时间:8:00-16:00
迪恩网络APP
随时随地掌握行业动态
扫描二维码
关注迪恩网络微信公众号
两分法查找的前提:顺序方式存储,而且必须是排好序 直接上代码: function search($array, $target, $low = 0, $high = 0){ $len = count($array); $low = max($low, 0); $high = $high == 0 ? $len : min($high, $len); while($low <= $high){ $m = $low + ceil((($high - $low) / 2)); $mv = $array[$m]; if($mv > $target){ $high = $m - 1; }else if($mv < $target){ $low = $m + 1; }else{ return $m; } } return -1; } $array = array(1, 2, 4, 5, 7, 8, 9, 10); echo search($array, 9);
|
2022-08-17
2022-11-06
2022-07-29
2022-08-18
2022-08-13
请发表评论