数据结构和算法——快速排序

$numbers = [21,25,100,98,89,77];

PROCEDURE function quickSort    IF list is empty        Return the list    END IF     Choose first element as the pivot     FOR each element of the list start from position 1         IF element is greater than pivot            Assign it to the left side        ELSE            Assign it to the right side        END IF     END FOR     return quickSort(left)+pivot+quickSort(right) END PROCEDURE

<?php$arrayToSort = [21, 25, 100, 98, 89, 77]; function quickSort($data){    if (count($data) == 0) {        return $data;    }     $pivot = $data[0];     $left = $right = [];     for ($i = 1; $i < count($data); $i++) {        if ($data[$i] < $pivot) {            $left[] = $data[$i];        } else {            $right[] = $data[$i];        }    }     return array_merge(quicksort($left), array($pivot), quicksort($right));} print_r(quickSort($arrayToSort)); // Output:/*Array(    [0] => 21    [1] => 25    [2] => 77    [3] => 89    [4] => 98    [5] => 100)*/