//二分查找
function binarySearch($arr, $low, $high, $k){
if ($low <= $high){
$mid = intval(($low+$high)/2);
if ($arr[$mid] == $k){
return $mid;
}elseif ($k < $arr[$mid]){
return binarySearch($arr, $low, $mid-1, $k);
}else{
return binarySearch($arr, $mid+1, $high, $k);
}
}
die("Not found");
}
//二分查找
function find_by_half($arr, $val) {
$first = 0;
$last = count($arr)-1;
while ($last >= $first) {
$mid = intval(($last+$first)/2);
if ($arr[$mid] == $val) return $mid;
if ($arr[$mid] > $val) {
$last = $mid -1;
} else {
$first = $mid+1;
}
}
return "not found";
}
//快速排序(一维数组)
function quick_sort($array){
if (count($array) <= 1) return $array;
$key = $array[0];
$left_arr = array();
$right_arr = array();
for ($i=1; $i<count($array); $i++){
if ($array[$i] <= $key)
$left_arr[] = $array[$i];
else
$right_arr[] = $array[$i];
}
$left_arr = quick_sort($left_arr);
$right_arr = quick_sort($right_arr);
return array_merge($left_arr, array($key), $right_arr);
}
//冒泡排序
function bsort($arr) {
$c = count($arr);
for ($i = $c - 1; $i > 0; $i--) {
for ($j = $i - 1; $j > -1; $j--) {
if ($arr[$i] > $arr[$j]) {
$temp = $arr[$i];
$arr[$i] = $arr[$j];
$arr[$j] = $temp;
}
}
}
unset($temp);
return $arr;
}
//冒泡排序
function bubble_sort($arr){
$count = count($arr);
if ($count <= 0) return false;
for($i=0; $i<$count; $i++){
for($j=$count-1; $j>$i; --$j){
if ($arr[$j] < $arr[$j-1]){
$tmp = $arr[$j];
$first = $arr[$j] = $arr[$j-1];
$next = $arr[$j-1] = $tmp;
}
}
}
return $arr;
}
//插入排序
function insert_sort($arr){
$count = count($arr);
for($i=1; $i<$count; $i++){
$tmp = $arr[$i];
$j = $i - 1;
while($arr[$j] > $tmp){
$arr[$j+1] = $arr[$j];
$arr[$j] = $tmp;
$j--;
}
}
return $arr;
}
//选择排序
function select_sort($arr) {
$index = count($arr);
for ($i = 0; $i < $index-1; $i++) {
for ($j = $i+1; $j < $index; $j++) {
if ($arr[$i] > $arr[$j]) {
$temp = $arr[$j];
$arr[$j] = $arr[$i];
$arr[$i] = $temp;
}
}
}
return $arr;
}