冒泡排序及其优化

import java.util.Arrays;

public class Demo06 {
    public static void main(String[] args) {
        int[] a={1,2,45,0,32,45,8,1};
        int temp=0;
        for (int i = 0; i <a.length-1; i++) {
            boolean flag = false; //通过flag标志位减少没有意义的比较
            for (int j = 0; j < a.length-1-i; j++) {
                if(a[j]<a[j+1]){
                    temp=a[j];
                    a[j]=a[j+1];
                    a[j+1]=temp;
                    flag=true;
                }
            }
            if(flag == false){
                break;
            }
        }
        System.out.println(Arrays.toString(a));
    }
}