选择排序-详解

 

public class SelectionSort {

    static  final  int SIZE=10;
    /**
     * 选择法排序
     * @param a
     */
   public static   void selectSort(int[] a){
        int index;
        int temp;//交换临时变量

       for (int i = 0; i <a.length-1 ; i++) {
           index=i;
           for (int j = i+1; j <a.length ; j++) {
               if(a[j]<a[index]){
                   index=j;
               }
           }
           if(index!=i){
               temp=a[i];
               a[i]=a[index];
               a[index]=temp;
           }
           System.out.print("第"+i+"步排序结果");
           for (int h = 0; h <a.length ; h++) {
               System.out.print(+a[h]+"\t");
           }
           System.out.print("\n");
       }
   }
    public static void main(String[] args) {
        int [] shuzu=new int[SIZE];
        int i;

        for ( i = 0; i <SIZE ; i++) {
            shuzu[i]=(int)(100+Math.random()*(100+1));
        }
        System.out.print("排序前的数组为：\n");
        for ( i = 0; i < SIZE; i++) {
            System.out.print(shuzu[i]+"\t");
        }
        System.out.print("\n");
        selectSort(shuzu);
        System.out.print("排序后的数组为：\n");
        for ( i = 0; i < SIZE; i++) {
            System.out.print(shuzu[i]+"\t");
        }
        System.out.print("\n");
    }
}