题解 | #排序#

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

    }


    return 0;
}