冒泡排序

public static void main(String[] args) {
  int[] a = {1132,123,99,88,456,66,55,33,22,11,11111,933339,77,34,1};
  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+1];
     a[j+1] = a[j];
     a[j] = temp;
    }
   }
   for (int k = 0; k < a.length; k++) {
    System.out.print(a[k]+"\t");
   }
   System.out.println();
  }
  System.out.println();
  for (int i = 0; i < a.length; i++) {
   System.out.print(a[i]+"\t");
  }
 }