<?php
/**
 *  查找
 *
 **/
// 順序查找
function normal_search($arrData,$val) {
    $len = count($arrData);
    if($len == 0) return -1;
    for($i = 0;$i < $len; $i++ ) {
        echo "find No.",$i + 1," value = ",$arrData[$i]," is = ",$val,"? <br/>";
        // 找到了
        if($arrData[$i] == $val) return $i;
    }
    return -1;
}
 
// 測試順序查找
$arrData = array(4,51,6,73,2,5,9,33,50,3,4,6,1,4,67);
echo normal_search($arrData,6),"<br/>";
echo normal_search($arrData,66),"<br/>";
 
// 二分法查找(針對有序的列進(jìn)行查找)
function binary_search($arrData,$val) {
    $len = count($arrData);
    if($len == 0) return -1;
 
    $start = 0;
    $end   = $len - 1;
 
    while($start <= $end) {
        $middle = intval(($start + $end)/2);
        echo "start = ",$start," end = ",$end," middle = ",$middle,"<br/>";
        if($arrData[$middle] == $val) {
            return $middle;
        } elseif ($arrData[$middle] > $val) {
            $end = $middle - 1 ;
        } elseif ($arrData[$middle] < $val) {
            $start = $middle + 1;
        }
    }
    return -1;
}
 
// 測試一下二分法查找
$arrData = array(1,2,3,4,5,7,8,9,11,23,56,100,104,578,1000);
echo binary_search($arrData,578),"<br/>";
echo binary_search($arrData,66),"<br/>";

標(biāo)簽：

版權(quán)申明：本站文章部分自網(wǎng)絡(luò)，如有侵權(quán)，請聯(lián)系：west999com@outlook.com
特別注意：本站所有轉(zhuǎn)載文章言論不代表本站觀點(diǎn)！
本站所提供的圖片等素材，版權(quán)歸原作者所有，如需使用，請與原作者聯(lián)系。