PHP 二分查找

Posted 2021-04-10 伟洪winnie

<?php
function BinarySearch($list, $low, $hight, $v){ if ($low > $hight) return -1;
 $mid = floor(($low + $hight) / 2);
 if ($list[$mid - 1] > $v) { return BinarySearch($list, $low, $mid - 1, $v); } elseif ($list[$mid - 1] < $v) { return BinarySearch($list, $mid + 1, $hight, $v); } else { return $mid; }}
function main(){ //TODO : 生成数据 $number = []; for ($i = 0; $i < 100; $i++) { $number[] = rand(0, 1000000); } sort($number);
 //TODO : 有序表查找:二分查找(静态查找, 没有重复数据) print_r(BinarySearch($number, 1, count($number), $number[70]));}
main();