java 冒泡排序

for (int i = 0; i < a.length - 1; i++) {
            for (int j = 0; j < a.length - i-1; j++) {
                if (a[j] > a[j + 1]) {
                    int temp = a[j];
                    a[j] = a[j + 1];
                    a[j + 1] = temp;
                }
              
            }
          
        }
        for(int p=0;p<a.length;p++){
         System.out.print(a[p]+" ");
        }
        System.out.println("");