冒泡排序bubble_sort

<?php

function bubble_sort($arr)
{
    $len = count($arr);
    for ($i = 0; $i < $len - 1; $i++) {
        $exchange = false;
        for ($j = 0; $j < $len - 1 - $i; $j++) {
            if ($arr[$j] > $arr[$j + 1]) {
                $temp = $arr[$j];
                $arr[$j] = $arr[$j + 1];
                $arr[$j + 1] = $temp;
                $exchange = true;
            }
        }
        echo implode(',', $arr);
        echo "\n";
        if (!$exchange) {
            // 如果没有发生交换，说明待排序的序列是有序的，无需再进行比较
            return $arr;
        }
    }

    return $arr;
}

//$arr = [3, 6, 2, 1, 5, 9, 7, 8, 4];
//$arr = [9, 8, 7, 6, 5, 4, 3, 2, 1];
//$arr = [1, 2, 3, 4, 5, 6, 7, 8, 9];
$arr = [7, 8, 9, 1, 2, 3, 4, 5, 6,];
echo implode(',', $arr);
echo "\n";
bubble_sort($arr);
//echo implode(',', bubble_sort($arr));
//echo "\n";