<?php //循环number遍 function test($array, $number) { $arraystr = implode(',', $array) . ','; $newstr = ''; for ($i = 0; $i < $number; $i++) { $newstr .= $arraystr; } $newstr = substr($newstr, 0, strlen($newstr) - 1); $newarray = explode(',', $newstr); return $newarray; } // $array = ['1','4','2','6']; // print_r(test($array,3)); //快速排序(数组排序) 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); } // $array = ['1','4','2','6']; // print_r(quick_sort($array)); //冒泡排序(数组排序) function bubble_sort($array) { $count = count($array); if ($count <= 0) return false; for ($i = 0; $i < $count; $i++) { for ($j = $count - 1; $j > $i; $j--) { if ($array[$j] < $array [$j - 1]) { $tmp = $array[$j]; $array[$j] = $array[$j - 1]; $array [$j - 1] = $tmp; } } } return $array; } // $array = ['1','4','2','6']; // print_r(bubble_sort($array)); //二分查找(数组里查找某个元素) function bin_sch($array, $low, $high, $k) { if ($low <= $high) { $mid = intval(($low + $high) / 2); if ($array[$mid] == $k) { return $mid; } elseif ($k < $array[$mid]) { return bin_sch($array, $low, $mid - 1, $k); } else { return bin_sch($array, $mid + 1, $high, $k); } } return -1; } // $array = ['1','4','2','6']; //$high = count($array); // print_r(bin_sch($array,0,$high,6)); //选择排序 function select_sort($arr) { for ($i = 0; $i < count($arr); $i++) { $key = $arr[$i]; $n = $i; for ($j = $i + 1; $j < count($arr); $j++) { if ($key > $arr[$j]) { $key = $arr[$j]; $n = $j; } } $arr[$n] = $arr[$i]; $arr[$i] = $key; } return $arr; } $array = ['1', '4', '2', '6']; print_r(select_sort($array)); print_r('<br/>------------<br/>'); ?>
排序
最新推荐文章于 2022-04-26 14:53:52 发布