As Easy As A+B

As Easy As A+B

These days, I am thinking about a question, how can I get a problem as easy as A+B? It is fairly difficulty to do such a thing. Of course, I got it after many waking nights.
Give you some integers, your task is to sort these number ascending (升序).
You should know how easy the problem is now!
Good luck! —-
Input
Input contains multiple test cases. The first line of the input is a single integer T which is the number of test cases. T test cases follow. Each test case contains an integer N (1<=N<=1000 the number of integers to be sorted) and then N integers follow in the same line.
It is guarantied that all integers are in the range of 32-int.
Output
For each case, print the sorting result, and one line one case.
Sample Input
2
3 2 1 3
9 1 4 7 2 5 8 3 6 9
Sample Output
1 2 3
1 2 3 4 5 6 7 8 9
AC代码

#include<stdio.h>
void main()
{
    int t;
    int a[1000];
    scanf("%d", &t);
    while (t--)
    {
        int m;
        scanf("%d", &m);
        for (int i = 0;i < m;i++)
            scanf("%d", &a[i]);
        for(int i=0;i<m;i++)
            for (int j = i;j < m;j++)
            {
                int tem;
                if (a[i] > a[j])
                {
                    tem = a[i];
                    a[i] = a[j];
                    a[j] = tem;
                }
            }
        printf("%d", a[0]);
        for (int i = 1;i < m;i++)
            printf(" %d", a[i]);
        printf("\n");

    }
}