题解 | 选择排序
选择排序
https://www.nowcoder.com/practice/af6a87dc2cf34c5cacc4a75cb9624681
#include<stdio.h>
int main(){
int n,k,min,a;
scanf("%d %d",&n,&k);
int c[n];
for (int i=0;i<n;i++){
scanf("%d",&c[i]);
};
for(int i=0;i<k;i++){
min=c[i];a=i;
for (int j=i+1;j<n;j++){
if(min>c[j]) {
min = c[j];
a = j;
}
}
c[a]=c[i];
c[i]=min;
};
for(int i=0;i<n;i++){
printf("%d ",c[i]);
};
return 0;
}
查看15道真题和解析