Java中冒泡排序的原生实现方法(正序与逆序)

public class T02 {
 public static void main(String[] args) {
  //冒泡升序
  int [] ary = {1,4,5,6,7,8,3,2};
  for (int i = 0; i <ary.length ; i++) {
   for (int j = (i+1); j <ary.length ; j++) {
    if (ary[i]>ary[j]){
     // 交换两者的值
     int c = ary[i];
     ary[i] = ary[j];
     ary[j] = c;
    }
   }
  }
  // 写在双重for循环外面
  for (int i1 : ary) {
   System.out.print(i1);
  }
 }
}

// Array.sort排序
  int [] ary = {2,4,1,3,5,6,8,7,9};
  Arrays.sort(ary);
  for (int i1 : ary) {
   System.out.print(i1);
  }
  System.out.println();
  // 倒序排列,没有方法
  for (int i = ary.length-1; i > -1 ; i--) {
   System.out.print(ary[i]);
  }
  System.out.println();