package cn.qujianlei.easy;

public class BubbleSortDemo {
    public static void bubbleSort(int...a){
        for(int i = 0;i<a.length-1;i++){
            for(int j=0;j<a.length-1-i;j++){
                if(a[j]>a[j+1]){
                    a[j]=a[j]^a[j+1];
                    a[j+1]=a[j]^a[j+1];
                    a[j]=a[j]^a[j+1];
                }
                System.out.print("  第"+(i+1)+"步中的第("+(j+1)+")分步：");
                for(int k=0;k<a.length;k++){
                    System.out.print(" "+a[k]);
                }
                System.out.println();
            }
            System.out.print("第"+(i+1)+"步排序结果：");
            for(int k=0;k<a.length;k++){
                System.out.print(" "+a[k]);
            }
            System.out.println();
        }
    }
    public static void main(String[] args) {
        int []shuzu={26,13,8,4,1};
        int i;
        System.out.println("排序前的数组为：");
        for(i=0;i<shuzu.length;i++){
            System.out.print(shuzu[i]+" ");
        }
        System.out.println();
        bubbleSort(shuzu);
        System.out.println("排序后的数组为：");
        for(i=0;i<shuzu.length;i++){
            System.out.print(shuzu[i]+" ");
        }
        System.out.println();
    }
}