1     //选择排序算法
 2     public void selectsort(int[] array){
 3         if(array.length == 0 || array == null)
 4             return;
 5         //每次选择最小的到最前
 6         for(int i = 0; i < array.length; i++){
 7             int min = i;
 8             for(int j = i+1; j < array.length; j++){
 9                 if(array[min] > array[j])
10                     min = j;
11             }
12             if(i != min){
13                 int temp = array[min];
14                 array[min] = array[i];
15                 array[i] = temp;
16             }
17             printArray(array,i+1);
18         }
19     }
20     public void printArray(int a[],int count){
21         if(count != 0)
22         System.out.print("第" + count + "次   ");
23         for(int m = 0; m < a.length; m++){
24             if(count == m && count != 0)
25                 System.out.print("|");
26             System.out.print(a[m] + " ");
27         }
28         System.out.println();
29     }
30     public static void main(String[] args) {
31         int a[] = {11,7,6,1,8,4,3,2};
32         SelectSort bs = new SelectSort();
33         bs.selectsort(a);
34     }