经典算法---冒泡排序

<?php $a = array(10,4,3,7,5,8,1,2); echo "原始数组："; for($m =0;$m<count($a);$m++){ echo "{$a[$m]} \t\t\t\t"; } 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+1]; $a[$j+1] = $a[$j]; $a[$j] = $temp; } } } echo "<br/>降序排列："; for($k =0;$k<count($a);$k++){ echo "{$a[$k]} \t\t\t\t"; } echo "<br/>升序排列："; for($q =count($a)-1;$q>=0;$q--){ echo "{$a[$q]} \t\t\t\t"; } ?>