冒泡排序代码实现

冒泡排序代码：

public class ArrayDemo {
    public static void main(String[] args) {

        int[] arr = {24, 69, 80, 57, 13};

        System.out.println("排序前：" + arrayToString(arr));

        for (int i = 0; i < arr.length - 1; i++) {
            for (int j = 0; j < arr.length - 1 - i; j++) {
                if (arr[j] > arr[j + 1]) {
                    int temp = arr[j];
                    arr[j] = arr[j + 1];
                    arr[j + 1] = temp;
                }
            }
        }

        System.out.println("排序后：" + arrayToString(arr));

    }

    //把数组中的元素按照指定的规则组成一个字符串：[1,2,3...]
    public static String arrayToString(int[] arr) {

        StringBuilder sb = new StringBuilder();
        sb.append("[");
        for (int i = 0; i < arr.length; i++) {
            if (i == arr.length - 1) {
                sb.append(arr[i]);
            } else {
                sb.append(arr[i]).append(",");
            }
        }
        sb.append("]");
        String s = sb.toString();
        return s;

    }
}
运行结果：
排序前：[24,69,80,57,13]
排序后：[13,24,57,69,80]