选择法排序 #include<stdio.h> //选择法 int main() { int a[10] = { 4,5,2,1,3,6,8,7,9,0 }; for (int i = 0; i < 9; i++) { for (int j = i + 1; j < 10; j++) { if (a[i] > a[j]) { int t; t = a[i]; a[i] = a[j]; a[j] = t; } } } for (int i = 0; i < 10; i++) { printf("%d\t", a[i]); } return 0; }