#include <stdio.h>
int main(){
printf("\n");
int list[]={5,2,1,6,9,8,3,4,7,};
int len=sizeof(list)/sizeof(list[0]);
printf("原始数组为:");
printList(list,len);
selectionSort(list,len);
printf("排序后数组:");
printList(list,len);
printf("\n");
return 0;
}
int printList(int* list,int len){
int i;
for(i=0;i<len;i++){
printf("%d",list[i]);
}
printf("\n\n");
return 0;
}
int selectionSort(int* list,int len){
printf("****selectionSort****\n\n");
int i,j,tmp,indx;
for(i=0;i<len;i++){
tmp=list[i];//未排序区间的第一位元素,找到最小元素后替换
indx=i;
for(j=i+1;j<len;j++){
if(list[i]>list[j]){
list[i]=list[j];
indx=j;
}
}
list[indx]=tmp;
printf("-第%d次选择:",i+1);
printList(list,len);
}
return 0;
}