冒泡排序

冒泡排序第一版

import java.util.Arrays;

public class T {
    public static void main(String[] args) {
        int[] arr = {424,87,989,3,2};

        int temp = 0;
        for (int i = 0; i < arr.length - 1; i++) {
            boolean flag = false;//flag标志位减少没有意义的比价 int[] arr = {2,1, 1, 1,1 };
            for (int j = 0; j < arr.length - 1 - i; j++) {
                System.out.println("第" + (i+1) + "次:arr[" + j + "]=" + arr[j] + ",arr[" + (j + 1) + "]=" + arr[j + 1]);
                if (arr[j] > arr[j + 1]) {
                    temp = arr[j + 1];
                    arr[j + 1] = arr[j];
                    arr[j] = temp;
                    flag = true;
                }
            }
            System.err.println("第" +(i+1)  + "次比较结果：" + Arrays.toString(arr));
            if (flag == false) {
                break;
            }
        }
        System.out.println("最终排序结果：" + Arrays.toString(arr));
    }

}