A simple quick sort in PHP
Release: 2016-07-25 08:42:38
Original
840 people have browsed it
Quick sorting is achieved by continuously locating the position of the reference number
- /**
- * Created by PhpStorm.
- * User: saint
- * Date: 15/8/5
- * Time: 上午11:49
- */
- class Demo
- {
- public $a = array(3, 6, 9, 2, 4 , 7, 1, 5, 8, 0);
-
- public function qsort($left, $right)
- {
- if($left > $right) {
- return;
- }
-
- $i = $left;
- $j = $right;
- $standard = $this->a[$left];
-
- while($i != $j) {
-
- // Find units smaller than the base number from right to left
- while(($standard <= $this->a[$j]) && ($j > $i)) {
- $j--;
- }
-
- // Find the standard number from left to right Big
- while(($standard >= $this->a[$i]) && ($j > $i)) {
- $i++;
- }
-
- $tmp = $this->a [$i];
- $this->a[$i] = $this->a[$j];
- $this->a[$j] = $tmp;
- }
-
- // OK The position of the base number
- $this->a[$left] = $this->a[$i];
- $this->a[$i] = $standard;
-
- $this->qsort ($left, $i - 1);
- $this->qsort($i + 1, $right);
- }
-
- // Execute function
- public function main()
- {
- $left = 0;
- $right = count($this->a) - 1;
- $this->qsort($left, $right);
- print_r($this->a);
- }
- }
-
- $demo = new Demo();
- $demo->main();
Copy code
From: http://my.oschina.net/liuke1556/blog/488215 |
PHP
Statement of this Website
The content of this article is voluntarily contributed by netizens, and the copyright belongs to the original author. This site does not assume corresponding legal responsibility. If you find any content suspected of plagiarism or infringement, please contact admin@php.cn
Latest Articles by Author
-
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