Take a value and compare it with other values. put a small value on the left of the value, a large value on the right of the value, and then follow this method to recursively code 1:
The code is as follows:
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 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:
The 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 --;
}
The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion;
products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the
content of the page makes you feel confusing, please write us an email, we will handle the problem
within 5 days after receiving your email.
If you find any instances of plagiarism from the community, please send an email to:
info-contact@alibabacloud.com
and provide relevant evidence. A staff member will contact you within 5 working days.