冒泡排序算法

 /**
   *  冒泡排序
   */

  int []  a = {5,7,13,2,-6 ,23,14,12,-3,8,15,4};
  /**
   * 冒泡排序算法一
   * 降序排列
   */
  int len = a.length;
  for (; -- len>0 ; ) {
      for(int i = 0 ; i< len ; ++i){
          if (a[i] < a[i+1]){
              int temp = a[i] ;
              a[i] = a[i+1] ;
              a[i+1] = temp ;
          }
      }
  }

System.out.println("排序算法一:");
  for (int n = 0; n <a.length ; ++n) {
      System.out.print(a[n]+" ");
  }


  System.out.println();
  /**
   * 冒泡排序算法二
   *  升序排列
   */
  int temp = 0;
  int k = 0;
  for (int i = 0; i < a.length; i++) {
      k = i ;
      for (int j = i+1; j < a.length; j++) {
          if (a[k] > a[j]){
              k = j ;
          }
          if (k != i) {
              temp = a[i] ;
              a[i] = a[k] ;
              a[k] = temp ;
          }
      }
  }

  System.out.println("冒泡排序算法二:" );
  for (int i = 0; i < a.length; i++) {
      System.out.print((a[i] + " "));
  }