Ŀ

գҪıйص䡣
һ repeat (0<repeat<10) repeat 㣺
һ n (1<n<=10) n ǴӴС
ʾΪ˵

3           (repeat=3) 
4           (n=4) 
5 1 7 6
3           (n=3) 
1 2 3
5           (n=5) 
5 4 3 2 1 

After sorted: 7 6 5 1 
After sorted: 3 2 1
After sorted: 5 4 3 2 1



#include <stdio.h>
int main(void)
{
    int i, index, k, n, temp;
    int repeat, ri;
    int a[10];

    scanf("%d", &repeat);
    for(ri = 1; ri <= repeat; ri++){
        scanf("%d", &n);
        for(i = 0; i < n; i++)
            scanf("%d", &a[i]);
/*---------*/
        printf("After sorted: ");
        for(i = 0; i < n; i++) 
            printf("%d ", a[i]);
        printf("\n");
    }
}