作者:劲吻2502877607 | 来源:互联网 | 2018-03-22 17:15
array as $k => $v)
{
if($v == $val)
{
echo '顺序查找成功!';
exit(0);
}
}
echo '顺序查找失败!';
}
/**
* 二分查找法
* @param $val 要查找的值
*/
public function bin_search($val)
{
sort($this->array);
$min = 0;
$max = count($this->array);
for ($i = $min; $i <$max; $i++)
{
$mid = ceil(($min + $max) / 2);
if($val == $this->array[$mid])
{
echo &#39;二分查找成功!&#39;;
exit(0);
}
else if($val <$this->array[$mid])
{
$max = $mid;
}
else if($val > $this->array[$mid])
{
$min = $mid;
}
}
echo &#39;二分查找失败!&#39;;
}
}