-
Notifications
You must be signed in to change notification settings - Fork 143
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
1 parent
beab267
commit ebf0aed
Showing
1 changed file
with
140 additions
and
140 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1,141 +1,141 @@ | ||
| <?php | ||
|
|
||
| /** | ||
| * 快速排序是找出一个元素（理论上可以随便找一个）作为基准(pivot),然后对数组进行分区操作,使基准左边元素的值都不大于基准值,基准右边的元素值 都不小于基准值，如此作为基准的元素调整到排序后的正确位置。递归快速排序，将其他n-1个元素也调整到排序后的正确位置。最后每个元素都是在排序后的正 确位置，排序完成。所以快速排序算法的核心算法是分区操作，即如何调整基准的位置以及调整返回基准的最终位置以便分治递归。 | ||
| * 时间复杂度 最坏O(n2) 平均 O(nlogn) | ||
| * 空间复杂度 O(log2n)~O(n) | ||
| */ | ||
|
|
||
| require_once __DIR__ . '/../uniqueRandom.php'; | ||
| require_once __DIR__ . '/../random.php'; | ||
| require_once __DIR__ . '/../insertSort/insertSort.php'; | ||
|
|
||
| function quickSort(&$arr) | ||
| { | ||
| $count = count($arr); | ||
| if ($count <= 1) { | ||
| return $arr; | ||
| } | ||
|
|
||
| $left = $right = []; | ||
| for ($i = 1; $i < $count; $i++) { | ||
| if ($arr[$i] < $arr[0]) { | ||
| $left[] = $arr[$i]; | ||
| } else { | ||
| $right[] = $arr[$i]; | ||
| } | ||
| } | ||
|
|
||
| $left = quickSort($left); | ||
| $right = quickSort($right); | ||
| return array_merge($left, [$arr[0]], $right); | ||
| } | ||
|
|
||
| $arr = randomArr(1, 100000, 10000, true, true); | ||
| $start = microtime(true); | ||
| qSort($arr, 0, count($arr) - 1); | ||
| $end = microtime(true); | ||
| $used = $end - $start; | ||
| echo "qSortV1 used $used s" . PHP_EOL; | ||
|
|
||
|
|
||
|
|
||
| //https://blog.csdn.net/ricardo18/article/details/78867143 | ||
| function qSort(array &$arr, int $p, int $r) | ||
| { | ||
| if ($p < $r) { | ||
| $q = partition($arr, $p, $r); | ||
| qSort($arr, $p, $q); | ||
| qSort($arr, $q + 1, $r); | ||
| } | ||
| } | ||
|
|
||
| function partition(array &$arr, int $p, int $r) | ||
| { | ||
| $pivot = $arr[$p]; | ||
| $i = $p - 1; | ||
| $j = $r + 1; | ||
|
|
||
| while (true) { | ||
| do { | ||
| $i++; | ||
| } while ($arr[$i] < $pivot); | ||
|
|
||
| do { | ||
| $j--; | ||
| } while ($arr[$j] > $pivot); | ||
|
|
||
| if ($i < $j) { | ||
| list($arr[$i], $arr[$j]) = [$arr[$j], $arr[$i]]; | ||
| } else { | ||
| return $j; | ||
| } | ||
|
|
||
| } | ||
| } | ||
|
|
||
| function qSortV2(array &$arr, int $p, int $r) | ||
| { | ||
| if ($r > $p) { | ||
| $q = partitionV2($arr, $p, $r); | ||
| qSortV2($arr, $p, $q - 1); | ||
| qSortV2($arr, $q + 1, $r); | ||
| } | ||
| } | ||
|
|
||
| function partitionV2(array &$arr, int $p, int $r) | ||
| { | ||
| //使用三数取中优化 | ||
| $pivot = retrivePivot($arr, $p, $r); | ||
| $i = $p; | ||
| $j = $r - 1; | ||
|
|
||
| for (;; ) { | ||
| while ($arr[++$i] < $pivot) { | ||
| } | ||
| while ($arr[--$j] > $pivot) { | ||
| } | ||
|
|
||
| if ($i < $j) { | ||
| list($arr[$i], $arr[$j]) = [$arr[$j], $arr[$i]]; | ||
| } else { | ||
| break; | ||
| } | ||
|
|
||
| } | ||
|
|
||
| //将pivot放到合适的位置，这就是比插入排序快的原因，因为这个值的位置以后不再变动 | ||
| list($arr[$i], $arr[$r - 1]) = [$arr[$r - 1], $arr[$i]]; | ||
| return $i; | ||
|
|
||
| } | ||
|
|
||
| //三数取中 克服固定中枢下有序数组排序慢的情况，但是数组值重复的情况下仍然无效 | ||
| //https://blog.csdn.net/insistgogo/article/details/7785038# | ||
| //https://www.cnblogs.com/chengxiao/p/6262208.html | ||
| function retrivePivot(&$arr, int $p, int $r) | ||
| { | ||
| $mid = intval(($p + $r) / 2); | ||
| if ($arr[$p] > $arr[$mid]) { | ||
| list($arr[$p], $arr[$mid]) = [$arr[$mid], $arr[$p]]; | ||
| } | ||
|
|
||
| if ($arr[$p] > $arr[$r]) { | ||
| list($arr[$p], $arr[$r]) = [$arr[$r], $arr[$p]]; | ||
| } | ||
|
|
||
| if ($arr[$r] < $arr[$mid]) { | ||
| list($arr[$r], $arr[$mid]) = [$arr[$mid], $arr[$r]]; | ||
| } | ||
|
|
||
| list($arr[$r - 1], $arr[$mid]) = [$arr[$mid], $arr[$r]]; | ||
|
|
||
| return $arr[$r - 1]; | ||
| } | ||
|
|
||
| $arr2 = randomArr(1, 100000, 10000, true, true); | ||
| $start = microtime(true); | ||
| qSortV2($arr2, 0, count($arr2) - 1); | ||
| $end = microtime(true); | ||
| $used = $end - $start; | ||
| <?php | ||
|
|
||
| /** | ||
| * 快速排序是找出一个元素（理论上可以随便找一个）作为基准(pivot),然后对数组进行分区操作,使基准左边元素的值都不大于基准值,基准右边的元素值 都不小于基准值，如此作为基准的元素调整到排序后的正确位置。递归快速排序，将其他n-1个元素也调整到排序后的正确位置。最后每个元素都是在排序后的正 确位置，排序完成。所以快速排序算法的核心算法是分区操作，即如何调整基准的位置以及调整返回基准的最终位置以便分治递归。 | ||
| * 时间复杂度 最坏O(n2) 平均 O(nlogn) | ||
| * 空间复杂度 O(log2n)~O(n) | ||
| */ | ||
|
|
||
| require_once __DIR__ . '/../uniqueRandom.php'; | ||
| require_once __DIR__ . '/../random.php'; | ||
| require_once __DIR__ . '/../insertSort/insertSort.php'; | ||
|
|
||
| function quickSort(&$arr) | ||
| { | ||
| $count = count($arr); | ||
| if ($count <= 1) { | ||
| return $arr; | ||
| } | ||
|
|
||
| $left = $right = []; | ||
| for ($i = 1; $i < $count; $i++) { | ||
| if ($arr[$i] < $arr[0]) { | ||
| $left[] = $arr[$i]; | ||
| } else { | ||
| $right[] = $arr[$i]; | ||
| } | ||
| } | ||
|
|
||
| $left = quickSort($left); | ||
| $right = quickSort($right); | ||
| return array_merge($left, [$arr[0]], $right); | ||
| } | ||
|
|
||
| $arr = randomArr(1, 100000, 10000, true, true); | ||
| $start = microtime(true); | ||
| qSort($arr, 0, count($arr) - 1); | ||
| $end = microtime(true); | ||
| $used = $end - $start; | ||
| echo "qSortV1 used $used s" . PHP_EOL; | ||
|
|
||
|
|
||
|
|
||
| //https://blog.csdn.net/ricardo18/article/details/78867143 | ||
| function qSort(array &$arr, int $p, int $r) | ||
| { | ||
| if ($p < $r) { | ||
| $q = partition($arr, $p, $r); | ||
| qSort($arr, $p, $q); | ||
| qSort($arr, $q + 1, $r); | ||
| } | ||
| } | ||
|
|
||
| function partition(array &$arr, int $p, int $r) | ||
| { | ||
| $pivot = $arr[$p]; | ||
| $i = $p - 1; | ||
| $j = $r + 1; | ||
|
|
||
| while (true) { | ||
| do { | ||
| $i++; | ||
| } while ($arr[$i] < $pivot); | ||
|
|
||
| do { | ||
| $j--; | ||
| } while ($arr[$j] > $pivot); | ||
|
|
||
| if ($i < $j) { | ||
| list($arr[$i], $arr[$j]) = [$arr[$j], $arr[$i]]; | ||
| } else { | ||
| return $j; | ||
| } | ||
|
|
||
| } | ||
| } | ||
|
|
||
| function qSortV2(array &$arr, int $p, int $r) | ||
| { | ||
| if ($r > $p) { | ||
| $q = partitionV2($arr, $p, $r); | ||
| qSortV2($arr, $p, $q - 1); | ||
| qSortV2($arr, $q + 1, $r); | ||
| } | ||
| } | ||
|
|
||
| function partitionV2(array &$arr, int $p, int $r) | ||
| { | ||
| //使用三数取中优化 | ||
| $pivot = retrivePivot($arr, $p, $r); | ||
| $i = $p; | ||
| $j = $r - 1; | ||
|
|
||
| for (;; ) { | ||
| while ($arr[++$i] < $pivot) { | ||
| } | ||
| while ($arr[--$j] > $pivot) { | ||
| } | ||
|
|
||
| if ($i < $j) { | ||
| list($arr[$i], $arr[$j]) = [$arr[$j], $arr[$i]]; | ||
| } else { | ||
| break; | ||
| } | ||
|
|
||
| } | ||
|
|
||
| //将pivot放到合适的位置，这就是比插入排序快的原因，因为这个值的位置以后不再变动 | ||
| list($arr[$i], $arr[$r - 1]) = [$arr[$r - 1], $arr[$i]]; | ||
| return $i; | ||
|
|
||
| } | ||
|
|
||
| //三数取中 克服固定中枢下有序数组排序慢的情况，但是数组值重复的情况下仍然无效 | ||
| //https://blog.csdn.net/insistgogo/article/details/7785038# | ||
| //https://www.cnblogs.com/chengxiao/p/6262208.html | ||
| function retrivePivot(&$arr, int $p, int $r) | ||
| { | ||
| $mid = intval(($p + $r) / 2); | ||
| if ($arr[$p] > $arr[$mid]) { | ||
| list($arr[$p], $arr[$mid]) = [$arr[$mid], $arr[$p]]; | ||
| } | ||
|
|
||
| if ($arr[$p] > $arr[$r]) { | ||
| list($arr[$p], $arr[$r]) = [$arr[$r], $arr[$p]]; | ||
| } | ||
|
|
||
| if ($arr[$r] < $arr[$mid]) { | ||
| list($arr[$r], $arr[$mid]) = [$arr[$mid], $arr[$r]]; | ||
| } | ||
|
|
||
| list($arr[$r - 1], $arr[$mid]) = [$arr[$mid], $arr[$r]]; | ||
|
|
||
| return $arr[$r - 1]; | ||
| } | ||
|
|
||
| $arr2 = randomArr(1, 100000, 10000, true, true); | ||
| $start = microtime(true); | ||
| qSortV2($arr2, 0, count($arr2) - 1); | ||
| $end = microtime(true); | ||
| $used = $end - $start; | ||
| echo "qSortV2 used $used s" . PHP_EOL; |