java算法 冒泡排序

public class demo {
    public static void main(String[] args) {
        int[] a = { 34, 53, 12, 32, 56, 17 };
        System.out.println(a);
        for (int n:a){
            System.out.print(n+" ");
        }
        System.out.println();
        int temp;
        for (int i=0;i<a.length;i++){
            for (int j=0;j<a.length-i-1;j++){
                if (a[j]>a[j+1]){
                    temp=a[j];
                    a[j]=a[j+1];
                    a[j+1]=temp;
                }
            }
        }
        for (int n:a){
            System.out.print(n+" ");
        }


    }
}