import java.util.Arrays;

/**
 * @author 興趣使然黃小黃
 * @version 1.0
 * 冒泡排序優(yōu)化
 */
public class BubbleSort {

    public static void main(String[] args) {
        int[] array = {5, 1, 2, 3, 4};
        //排序前
        System.out.println("排序前:" + Arrays.toString(array));

        boolean flag = false; //用于標(biāo)記是否進(jìn)行了交換，true則說(shuō)明進(jìn)行了交換，false表示無(wú)

        //冒泡排序
        for (int i = 0; i < array.length - 1; i++) {
            System.out.println("第" + (i+1) + "趟排序開始!");
            for (int j = 0; j < array.length - i - 1; j++) {
                //如果前面的數(shù)比后面的數(shù)大，則交換
                if(array[j] > array[j+1]){
                    //交換
                    flag = true; //標(biāo)記進(jìn)行了交換
                    int temp = array[j];
                    array[j] = array[j+1];
                    array[j+1] = temp;
                }
                System.out.println("------第" + (j+1) + "趟排序: " + Arrays.toString(array));
            }
            System.out.println("第" + (i+1) + "趟排序完成: " + Arrays.toString(array));
            System.out.println("================================================");
            if (!flag){
                //如果沒有進(jìn)行交換則直接退出，說(shuō)明排序已經(jīng)完成
                break;
            }else {
                //回退
                flag = false;
            }
        }

        //輸出排序后的結(jié)果
        System.out.println("排序后:" + Arrays.toString(array));
    }
}