PHP simple implementation of Quick sorting method _php Tutorial

PHP simple implementation of fast sorting method

In this paper, we describe the simple implementation of PHP fast sorting method. Share to everyone for your reference. The 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)); }

http://www.bkjia.com/PHPjc/979236.html www.bkjia.com true http://www.bkjia.com/PHPjc/979236.html techarticle PHP Simple implementation of fast sorting method in this paper, we describe the simple implementation of PHP fast sorting method. Share to everyone for your reference. The implementation method is as follows: 1 2 3 4 5 6 7 8 9, 1 ...

