相比快速排序,冒泡排序要简单很多了
public function bubbleSort($data) { $size = count($data); for($i=1;$i<$size;$i++) for($j=0;$j<$size-$i;$j++){ if($data[$j]>$data[$j+1]) { $tmp = $data[$j]; $data[$j] = $data[$j+1]; $data[$j+1] = $tmp; } } return $data; }
相比快速排序,冒泡排序要简单很多了
public function bubbleSort($data) { $size = count($data); for($i=1;$i<$size;$i++) for($j=0;$j<$size-$i;$j++){ if($data[$j]>$data[$j+1]) { $tmp = $data[$j]; $data[$j] = $data[$j+1]; $data[$j+1] = $tmp; } } return $data; }