微信扫一扫

028-83195727 , 15928970361
business@forhy.com

二分查找算法

二分查找,算法2016-11-03

function binarySearch($low=0, $high, $search)
{
    $mid = ceil(($low+$high) / 2);
    if($search < $mid)
    {
        binarySearch($low, $mid-1, $search);
    } else if($search > $mid)
    {
        binarySearch($mid+1, $high, $search);
    } else
    {
        echo $mid;
    }
}

echo binarySearch(0, 200, 122);