#include "stdio.h"
#include "stdlib.h"
#include "string.h"
void main() {
int a[10] = {2,6,9,4,3,5,0,8,7,1};
int tmp;
printf("排序之前\n");
for (int i = 0; i < 10; i++) {
printf("a[%d]: %d\n", i, a[i]);
}
for (int i = 0; i < 10; i++) {
for (int j = i + 1; j < 10; j++) {
if (a[i] > a[j]) {
tmp = a[i];
a[i] = a[j];
a[j] = tmp;
}
}
}
printf("排序之后\n");
for (int i = 0; i < 10; i++) {
printf("a[%d]: %d\n", i, a[i]);
}
printf("Hello,World!\n");
system("pause");
}
数据结构:排序算法
最新推荐文章于 2022-12-09 20:02:02 发布