Home > Article > Backend Development > PHP implements quick sort algorithm_PHP tutorial
PHP implements quick sort algorithm_PHP tutorial
- WBOYOriginal
- 2016-07-13 17:44:52841browse
function quicksort($seq) {
if (count($seq) > 1) {
$k = $seq[0];
$x = array();
$y = array();
for ($i=1; $i
if ($seq[$i] <= $k) {
$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));
?>
Statement：
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
Previous article：The difference between php include and require_PHP tutorialNext article：The difference between php include and require_PHP tutorial