JAVA排序算法

public class xuanzhepaixu {
  public static void main(String[] args) {
    // TODO Auto-generated method stub
    int[]array= {64,4,24,1,3,15};
    System.out.println("排序前数组为：");
    for(int e:array)
      System.out.print(e+" ");
    System.out.println();
    paixu(array);
    System.out.println("排序后数组为：");
    for(int e:array)
      System.out.print(e+" ");
  }
  public static void paixu(int[] array) {
    int index;
    for(int i=1;i<array.length;i++) {//外层循环控制排序趟数
      index=0;
      for(int j=1;j<=array.length-i;j++) {//随着趟数的增加，比较的次数减少
        if(array[j]>array[index])
          index=j;
      int temp=array[array.length-i];
      array[array.length-i]=array[index];
      array[index]=temp;
      }
    }
  }
}