php手册 怎么查找,PHP实现查找表

//二分查找

$array = explode(",", $file);

sort($array);

$st = time();

$k = 43;

$n = count($array);

$r = bin_sch($array, 0, $n-1, $k);

$et = time();

$t = $et-$st;

echo "Process time: ". $t ."/s";

?>

以上输出: Process time: 0/s

//顺序查找

$st = time();

$k = 43;

$n = count($array);

$r = seq_sch($array, $n, $k);

$et = time();

$t = $et-$st;

echo "Process time: ". $t ."/s";

?>

以上输出结果：Process time: 9/s

上面轻易就能够看出谁的效率高了。

【算法改进】

//二分查找(递归消除)

function bin_sch($array, $n, $k){

$low = 0;

$high = $n-1;

while($low <= $high){

$mid = intval(($high-$low)/2);

if ($array[$mid] == $k)

return $mid;

elseif ($k < $array[$mid]){

$high = $mid - 1;

}else{

$low = $mid + 1;

}

}

return -1;

}

//顺序查找(改进版)

function seq_sch($array, $n, $k){

$array[$n] = $k;

for($i=0; ; $i++){

if($array[$i]==$k){

break;

}

}

if ($i return $i;

}else{

return -1;

}

}

?>

能看出上面两个函数做了什么改变吗？效率提升了多少？