PHP二分查找算法

$array = [63,65,69,70,71,73,75,76,77,79,89];
$k = 73;
$low = 0;
$high = count($array)-1;
// 二分查找 数组里查找某个元素 递归方式
function binSearch($array, $low, $high, $k){
    if ($low <= $high){
        $mid = intval(($low+$high)/2);
        if ($array[$mid] == $k){
            return $mid;
        }elseif ($k < $array[$mid]){
            return binSearch($array, $low, $mid-1, $k);
        }else{
            return binSearch($array, $mid+1, $high, $k);
        }
    }
    return -1;
}
$ret = binSearch($array, $low, $high, $k);
var_dump($ret); // 5

// 二分查找 循环方式
function binSearch2($array, $k){
    $low = 0;
    $high = count($array)-1;
    $f = -1;
    while (true){
        if ($low <= $high){
            $mid = intval(($low + $high)/2);
            if ($array[$mid] == $k){
                $f = $mid;
                break;
            } elseif ($array[$mid] < $k){
                $low = $mid+1;
            } elseif ($array[$mid] > $k){
                $high = $mid-1;
            }
        } else {
            break;
        }
    }
    return $f;

}
$ret = binSearch2($array, $k);
var_dump($ret); // 5

// 关联数组的二分查找算法
// 两次二分查找，找到了$k，针对关联数组，我们使用了php的array_keys函数获得这个关联有序数组的key，通过key间接比对$k和$array的值。
$array = ['a'=>1,'b'=>3,'c'=>6,'d'=>9,'e'=>13,'f'=>18,'g'=>19,'h'=>29,'i'=>38];
$k = 19;
function binSearch3($array, $k){
    $low = 0;
    $high = count($array)-1;
    $keyMap = array_keys($array);
    $f = -1;
    while (true){
        if ($low <= $high){
            echo $low.','.$high.PHP_EOL;
            $mid = intval(($low + $high)/2);
            if ($array[$keyMap[$mid]] == $k){
                $f = $keyMap[$mid];
                break;
            } elseif ($array[$keyMap[$mid]] < $k){
                $low = $mid+1;
            } elseif ($array[$keyMap[$mid]] > $k){
                $high = $mid-1;
            }
        } else {
            break;
        }
    }
    return $f;
}
$f = binSearch3($array, $k);
var_dump($f); // g

相关推荐：
PHP顺序查找算法   PHP二分查找算法   PHP快速排序算法   PHP快速排序   PHP冒泡排序