冒泡排序——基础版

//冒泡排序——基础版
public class ball {
    public static void main(String[] args) {
        int[] arr = {21,12,2,30,50,69,5,0,3,87};
        int max = 0;
        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]) {
                    arr[j] = arr[j]+arr[j+1];
                    arr[j+1] = arr[j] - arr[j+1];
                    arr[j] = arr[j] - arr[j+1];
                }//如果数组中前位大于后位，将数组中前后两位交换
        }
        }
        for (int n = 0; n < arr.length; n++) {
            System.out.println(arr[n]);
        }
    }
}