冒泡算法

public class Bubble {
    public static void main(String[] args) {
        int[] arr = {1, 45, 33, 77, 22};

        for (int j = 0; j < arr.length - 1; j++) {
            for (int i = 0; i < arr.length - 1 - j; i++) {      //冒泡排序
                if (arr[i] > arr[i + 1]) {
                    int a = arr[i];
                    arr[i] = arr[i+1];
                    arr[i+1] = a;
                }
            }
        }

        System.out.println(Arrays.toString(arr));   //效果和下面的方法一样
        System.out.println(Array(arr));
    }

    public static String Array(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] + "  ");
            }
        }
        sb.append("]");
        String s = sb.toString();
        return s;
    }
}