- function quicksortX(&$seq)
- {
- $stack = array($seq);
- $sort = array();
- while ($stack) {
- $arr = array_pop($stack);
- if(count($arr) if (count($arr) == 1) {
- $sort[] = &$arr[0];
- }
- continue;
- }
- $k = $arr[0];
- $x = array();
- $y = array();
- $_size = count($arr);
- for ($i = 1; $i if ($arr[$i] $x[] = &$arr[$i];
- } else {
- $y[] = &$arr[$i];
- }
- }
- !empty($y) && array_push($stack, $y);
- array_push($stack, array($arr[0]));
- !empty($x) && array_push($stack, $x);
- }
- return $sort;
- }
|
迭代, PHP
本站声明
本文内容由网友自发贡献，版权归原作者所有，本站不承担相应法律责任。如您发现有涉嫌抄袭侵权的内容，请联系admin@php.cn
作者最新文章
-
2024-10-22 09:46:29
-
2024-10-13 13:53:41
-
2024-10-12 12:15:51
-
2024-10-11 22:47:31
-
2024-10-11 19:36:51
-
2024-10-11 15:50:41
-
2024-10-11 15:07:41
-
2024-10-11 14:21:21
-
2024-10-11 12:59:11
-
2024-10-11 12:17:31
