$arr = array(49, 38, 65, 97, 76, 13, 27);
function quickSort($arr, $l, $r){
$p = floor(($l+$r)/2);
$key = $arr[$p];
echo "p={$p}, key={$key} \n";
for($i=$l, $j=$r; $i!=$j; ){
echo "移右边的小数 \n";
echo "\$arr[\$j]={$arr[$j]}, key={$key} \n";
$j = $r;
while(($j > $p) && ($arr[$j] > $key)){
$j--;
echo "now j={$j} \n";
}
if($j != $p){
echo "交换j前:".implode(',', $arr)." \n";
echo "交换 j={$j} \n";
$tmp = $arr[$j];
$arr[$j] = $key;
$key = $arr[$p] = $tmp;
echo "交换后:".implode(',', $arr)." \n";
}
echo "移左边的小数 \n";
$i = $l;
while(
快速排序-php实例
最新推荐文章于 2021-03-09 22:12:55 发布