for($i=0;$i<count($a)-1;$i++){
for($j=0;$j<count($a)-$i-1;$j++){
if($a[$j]>$a[$j+1]){
$temp=$a[$j];
$a[$j]=$a[$j+1];
$a[$j+1]=$temp;
}
}
}
for($j=0;$j<count($a)-$i-1;$j++){
if($a[$j]>$a[$j+1]){
$temp=$a[$j];
$a[$j]=$a[$j+1];
$a[$j+1]=$temp;
}
}
}
这是冒泡排序算法i控制循环的趟数,j控制每趟内部循环比较的次数