php数据结构与算法(PHP描述) 查找与二分法查找_PHP
Jun 01, 2016 pm 12:11 PM
复制代码 代码如下:
/**
* 查找
*
**/
// 顺序查找
function normal_search($arrData,$val) {
$len = count($arrData);
if($len == 0) return -1;
for($i = 0;$i echo "find No.",$i + 1," value = ",$arrData[$i]," is = ",$val,"?
";
// 找到了
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),"
";
echo normal_search($arrData,66),"
";
// 二分法查找(针对有序的列进行查找)
function binary_search($arrData,$val) {
$len = count($arrData);
if($len == 0) return -1;
$start = 0;
$end = $len - 1;
while($start $middle = intval(($start + $end)/2);
echo "start = ",$start," end = ",$end," middle = ",$middle,"
";
if($arrData[$middle] == $val) {
return $middle;
} elseif ($arrData[$middle] > $val) {
$end = $middle - 1 ;
} elseif ($arrData[$middle] $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),"
";
echo binary_search($arrData,66),"
";
/**
* 查找
*
**/
// 顺序查找
function normal_search($arrData,$val) {
$len = count($arrData);
if($len == 0) return -1;
for($i = 0;$i echo "find No.",$i + 1," value = ",$arrData[$i]," is = ",$val,"?
";
// 找到了
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),"
";
echo normal_search($arrData,66),"
";
// 二分法查找(针对有序的列进行查找)
function binary_search($arrData,$val) {
$len = count($arrData);
if($len == 0) return -1;
$start = 0;
$end = $len - 1;
while($start $middle = intval(($start + $end)/2);
echo "start = ",$start," end = ",$end," middle = ",$middle,"
";
if($arrData[$middle] == $val) {
return $middle;
} elseif ($arrData[$middle] > $val) {
$end = $middle - 1 ;
} elseif ($arrData[$middle] $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),"
";
echo binary_search($arrData,66),"
";
Statement of this Website
The content of this article is voluntarily contributed by netizens, and the copyright belongs to the original author. This site does not assume corresponding legal responsibility. If you find any content suspected of plagiarism or infringement, please contact admin@php.cn

Hot Article
How Long Does It Take To Beat Split Fiction?
3 weeks ago
By DDD
Repo: How To Revive Teammates
3 weeks ago
By 尊渡假赌尊渡假赌尊渡假赌
Hello Kitty Island Adventure: How To Get Giant Seeds
3 weeks ago
By 尊渡假赌尊渡假赌尊渡假赌
R.E.P.O. Energy Crystals Explained and What They Do (Yellow Crystal)
1 weeks ago
By 尊渡假赌尊渡假赌尊渡假赌

Hot tools Tags

Hot Article
How Long Does It Take To Beat Split Fiction?
3 weeks ago
By DDD
Repo: How To Revive Teammates
3 weeks ago
By 尊渡假赌尊渡假赌尊渡假赌
Hello Kitty Island Adventure: How To Get Giant Seeds
3 weeks ago
By 尊渡假赌尊渡假赌尊渡假赌
R.E.P.O. Energy Crystals Explained and What They Do (Yellow Crystal)
1 weeks ago
By 尊渡假赌尊渡假赌尊渡假赌

Hot Article Tags

Notepad++7.3.1
Easy-to-use and free code editor

SublimeText3 Chinese version
Chinese version, very easy to use

Zend Studio 13.0.1
Powerful PHP integrated development environment

Dreamweaver CS6
Visual web development tools

SublimeText3 Mac version
God-level code editing software (SublimeText3)

Hot Topics

11 Best PHP URL Shortener Scripts (Free and Premium)

Working with Flash Session Data in Laravel

Simplified HTTP Response Mocking in Laravel Tests

Build a React App With a Laravel Back End: Part 2, React

cURL in PHP: How to Use the PHP cURL Extension in REST APIs

12 Best PHP Chat Scripts on CodeCanyon
