选择排序

package coding;

public class cha04_selectSort {
static final int SIZE=20;
public static void selectSort(int [] a){
int index,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]);
}
System.out.println();
}
}
public static void main(String[] args) {
// TODO Auto-generated method stub
int [] shuzu=new int[SIZE];
int i;
for( i=0;i<SIZE;i++){
shuzu[i]=(int)(100+Math.random()*(100+1));

}
System.out.print("排序前的数组为");
for(i=0;i<SIZE;i++){
System.out.print(shuzu[i]+" ");
}
System.out.println();
selectSort(shuzu);
System.out.print("选择排序后的数组：");
for(i=0;i<SIZE;i++){
System.out.print(shuzu[i]+" ");
}
System.out.println();
}
}