PHP various sorting algorithm implementation codes_PHP tutorial

Copy code The code is as follows:

// Function: PHP implements various sorting algorithms
/ / Author: windlike
// Datetime: 2007-06-09

// Bubble sort
function BubbleSort($arr){
$num = count($arr);
for($i=1;$i<$num;$i++){
for($j=$num-1;$j>=$i;$j--){
if( $arr[$j]<$arr[$j-1]){
$iTemp = $arr[$j-1];
$arr[$j-1] = $arr[$j ];
$arr[$j] = $iTemp;
}
}
}
return $arr;
}

// Exchange sort
function ExchangeSort($arr){
$num = count($arr);
for($i=0;$i<$num-1;$i++){
for($j =$i+1;$j<$num;$j++){
if($arr[$j]<$arr[$i]){
$iTemp = $arr[$i];
$arr[$i] = $arr[$j];
$arr[$j] = $iTemp;
}
}
}
return $arr;
}

//Selection sorting
function SelectSort($arr){
$num = count($arr);
for($i=0;$i<$ num-1;$i++){
$iTemp = $arr[$i];
$iPos = $i;
for($j=$i+1;$j<$num;$ j++){
if($arr[$j]<$iTemp){
$iTemp = $arr[$j];
$iPos = $j;
}
}
$arr[$iPos] = $arr[$i];
$arr[$i] = $iTemp;
}
return $arr;
}

// Insertion sorting
function InsertSort($arr){
$num = count($arr);
for($i=1;$i<$num;$i++){
$iTemp = $arr[$i];
$iPos = $i-1;
while(($iPos>=0) && ($iTemp<$arr[$iPos])){
$arr[$iPos+1] = $arr[$iPos];
$iPos--;
}
$arr[$iPos+1] = $iTemp;
}
return $arr;
}

// Quick sort
function QuickSort($arr){
$num = count($arr);
$l=$r= 0;
for($i=1;$i<$num;$i++){
if($arr[$i] < $arr[0]){
$left[] = $arr[$i];
$l++;
}else{
$right[] = $arr[$i];
$r++;
}
}
if($l > 1){
$left = QuickSort($left);
}
$new_arr = $left;
$new_arr[] = $arr[0];
if($r > 1){
$right = QuickSort($right);
}
for($i=0;$i<$r;$i++){
$new_arr[] = $right[$i];
}
return $new_arr;
}

$arr = array(7,1,6,5,2);
$arr_new = QuickSort($arr);
echo "

"; <br>print_r($arr_new); <br>echo "

";
?>

http://www.bkjia.com/PHPjc/320369.htmlwww.bkjia.comtruehttp: //www.bkjia.com/PHPjc/320369.htmlTechArticleCopy the code code as follows: ?php // Function: PHP implements various sorting algorithms // Author: windlike // Datetime: 2007-06-09 // Bubble sort function BubbleSort($arr){ $num = count($arr); fo...