As Easy As A+B
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 57780 Accepted Submission(s): 24675
Give you some integers, your task is to sort these number ascending (升序).
You should know how easy the problem is now!
Good luck!
It is guarantied that all integers are in the range of 32-int.
2 3 2 1 3 9 1 4 7 2 5 8 3 6 9
1 2 3 1 2 3 4 5 6 7 8 9
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
main()
{
int num[1010] = { 0 };
int T = 0, N = 0, i = 0, j = 0, a = 0, b = 0, tmp = 0;
scanf("%d", &T);
for (i = 0;i<T;i++)
{
scanf("%d", &N);
for (j = 0;j<N;j++)
{
scanf("%d", &num[j]);
}
for (a = 0;a<N-1;a++)
{
for (b = 0;b<N - a-1;b++)
{
if (num[b]>num[b + 1])
{
tmp = num[b];
num[b] = num[b + 1];
num[b + 1] = tmp;
}
}
}
for (j = 0;j<N - 1;j++)
printf("%d ", num[j]);
printf("%d\n", num[j]);
memset(num, 0, sizeof(num));
}
return 0;
}
343



被折叠的 条评论
为什么被折叠?



