#include <stdio.h>
int main()
{
int i, j, tmp;
int F[10];
for (i=0; i<10; i++)
scanf("%d", &F[i]);
for (i=1; i<10; i++) {
tmp = F[i];
j = i - 1;
while (F[j] < tmp) {
F[j+1] = F[j];
j--;
}
F[j+1] = tmp;
}
for (i=0; i<10; i++)
printf("%d ", F[i]);
printf("\n");
return 0;
}
常见排序-插入排序
最新推荐文章于 2023-11-16 23:47:33 发布