Php implementation of quick sorting Function Code

Code 1: Copy codeThe Code is as follows: <? Php
Function quicksort ($ str ){
If (count ($ str) <= 1) return $ str; // if the number is not big, return directly
$ Key = $ str [0]; // obtain a value for comparison later;
$ Left_arr = array ();
$ Right_arr = array ();
For ($ I = 1; $ I <count ($ str); $ I ++) {// place a value greater than $ key on the right and a small value on the left;
If ($ str [$ I] <= $ key)
$ Left_arr [] = $ str [$ I];
Else
$ Right_arr [] = $ str [$ I];
}
$ Left_arr = quicksort ($ left_arr); // recursion;
$ Right_arr = quicksort ($ right_arr );
Return array_merge ($ left_arr, array ($ key), $ right_arr); // combines the left and right values into an array;
} // The following is the test
$ Str = array (, 0 );
Print_r (quicksort ($ str ));
?>

Code 2:Copy codeThe Code is as follows:/* @ quick sorting */
Function quickSort ($ left, $ right, $ arr ){
$ L = $ left;
$ R = $ right;
$ Align = $ arr [($ left + $ right)/2];
$ Temp = 0;

While ($ l <$ r ){
While ($ arr [$ l] <$ Scheme ){
$ L ++;
}
While ($ arr [$ r]> $ region ){
$ R --;
}

If ($ l >=$ r) break;

$ Temp = $ arr [$ l];
$ Arr [$ l] = $ arr [$ r];
$ Arr [$ r] = $ temp;

If ($ arr [$ l] === pivot) -- $ r;
If ($ arr [$ r] === pivot) ++ $ l;
}

If ($ l = $ r ){
$ L ++;
$ R --;
}

If ($ left <$ r ){
QuickSort ($ left, $ r, $ arr );
} Elseif ($ right> $ l ){
QuickSort ($ l, $ right, $ arr );
} Else {
Return $ arr;
}
}