PHP实现快速排序算法
WBOYWBOYWBOYWBOYWBOYWBOYWBOYWBOYWBOYWBOYWBOYWBOYWB
发布: 2016-07-23 08:54:53
- function quicksort($seq) {
-
- if (count($seq) > 1) {
-
- $k = $seq[0];
-
- $x = array();
-
- $y = array();
-
- for ($i=1; $i
- if ($seq[$i]
- $x[] = $seq[$i];
-
- } else {
-
- $y[] = $seq[$i];
-
- }
-
- }
-
- $x = quicksort($x);
-
- $y = quicksort($y);
-
- return array_merge($x, array($k), $y);
-
- } else {
-
- return $seq;
-
- }
-
- }
-
-
-
- $arr = array(12,2,16,30,8,28,4,10,20,6,18);
-
- print_r(quicksort($arr));
-
- ?>
-
-
复制代码
|
PHP
本站声明
本文内容由网友自发贡献,版权归原作者所有,本站不承担相应法律责任。如您发现有涉嫌抄袭侵权的内容,请联系admin@php.cn
作者最新文章
-
2025-02-26 03:58:14
-
2025-02-26 03:38:10
-
2025-02-26 03:17:10
-
2025-02-26 02:49:09
-
2025-02-26 01:08:13
-
2025-02-26 00:46:10
-
2025-02-25 23:42:08
-
2025-02-25 22:50:13
-
2025-02-25 21:54:11
-
2025-02-25 20:45:11