PHP selection sorting algorithm implementation code

//Select sort function function
//Use references to reduce memory consumption
//Organization: bbs.it-home.org
function &select(&$arr){
 $count= count($arr);
 if($count>1){
 for($i=0;$i<$count-1;$i++){
 $k=$i;
 for($j=$i +1;$j<$count;$j++){
 if($arr[$j]<$arr[$k]){
 $k=$j;
 }
 }
 if($k!= $i){
 $tmp=$arr[$k];
 $arr[$k]=$arr[$i];
 $arr[$i]=$tmp;
 }
 }
 }
 return $ arr;
}

//Print array function
function printArr(&$arr){
 echo ""; </li>
<li> print_r($arr); </li>
<li> echo "";
}

 //Start testing
//Assign ten random values ​​to the array
for($i=0;$i<10;$i++){
 $testArr[]=rand(10,100);
}
printArr(select($ testArr));
?>

>>> Articles you may be interested in: PHP practical quick sorting algorithm example code A summary of the implementation of various sorting algorithms in PHP Small example of php bubble sort A simple example of implementing bubble sort in php PHP two-dimensional array sorting custom function php selection sorting implementation code php bubble sort implementation code php insertion sort implementation code php function to implement quick sort php function to implement quick sort php bubble sort exchange sort method Example of php bubble sort php code to implement bubble sort algorithm An example of php bubble sorting algorithm Examples of php bubble sort and quick sort Two methods of php two-dimensional array sorting php multidimensional array sorting