A simple way to implement quick sorting in PHP
This article describes an example of a simple way to implement quick sorting in PHP. Share it with everyone for your reference. The specific implementation method is as follows:
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
|
function quicksort($seq)
{
if(!count($seq)) return $seq;
$k = $seq[0];
$x = $y = array();
for($i=count($seq); --$i;)
{
if($seq[$i] <= $k)
{
$x[] = $seq[$i];
}
else
{
$y[] = $seq[$i];
}
}
return array_merge(quicksort($x),array($k),quicksort($y));
}
|
1
2
3
4
5
6
7
8
9
10
11
1213
14
15
16
17
18
|
function quicksort($seq)
{
if(!count($seq)) return $seq;
$k = $seq[0];
$x = $y = array();
for($i=count($seq); --$i;)
{
if($seq[$i] <= $k)
{
$x[] = $seq[$i];
}
else
{
$y[] = $seq[$i];
}
}
return array_merge(quicksort($x),array($k),quicksort($y));
}
|
http://www.bkjia.com/PHPjc/979236.htmlwww.bkjia.comtruehttp: //www.bkjia.com/PHPjc/979236.htmlTechArticleA simple method to implement quick sorting in PHP. This article describes a simple method to implement quick sorting in PHP. Share it with everyone for your reference. The specific implementation method is as follows: 1 2 3 4 5 6 7 8 9 10 1...
![[Web front-end] Node.js quick start](https://img.php.cn/upload/course/000/000/067/662b5d34ba7c0227.png)
