#include <stdio.h>
main()
{
int c[10],i,j,t;
for(i=0;i<10;i++)
scanf("%d",&c[i]);
for(i=0;i<9;i++)
for(j=0;j<9-i;j++)
if(c[j]>c[j+1])
{
t=c[j+1];
c[j+1]=c[j];
c[j]=t;
}
for(i=0;i<10;i++)
printf("%d ",c[i]);
}
相关文章
- 12-27剑指Offer 54. 字符流中第一个不重复的字符 (其他)
- 12-2754_pytorch GAN(生成对抗网络)、Gan代码示例、WGAN代码示例
- 12-27leetcode 54. Spiral Matrix 、59. Spiral Matrix II
- 12-27leetcode 54. Spiral Matrix
- 12-27W54 - 999、TensorFlow框架识别图片
- 12-2754. 螺旋矩阵 难度-LeetCode
- 12-27next(react)框架结合lib-flexible,postcss-pxtorem做pc端rem适配解决font-size一直是54px
- 12-27Educational Codeforces Round 54 (Rated for Div. 2) Solution
- 12-27Codeforces Educational Codeforces Round 54 题解
- 12-27CoderForces Round54 (A~E)