#include <stdio.h>
int main() {
int i, j, temp = 0, max, a[5] = {2, 5, 4, 1, 3};
for (j = 0; j < 5 - 1; j++) {
max = j;
for (i = j + 1; i < 5; i++) {
if (a[max] < a[i])
max = i;
}
temp = a[max];
a[max] = a[j];
a[j] = temp;
}
for (j = 0; j < 5; j++)
printf("%d", a[j]);
return 0;
}
选择排序法
最新推荐文章于 2024-09-27 17:57:19 发布