题解 | 排序

#include <stdio.h>

int main() {
    int op, n=0;
    scanf("%d", &n);
    int a[n];
    for (int i = 0; i < n; i++) {
        scanf("%d", &a[i]);
    }
    scanf("%d", &op);
    for (int i = 0; i < n; i++) {
        for (int j = 1; j < n-i; j++) {
            if (a[j-1]>a[j]) {
                int s = a[j-1];
                a[j-1] = a[j];
                a[j] = s;
            }
        }
    }
    if (op == 0) {
        for (int i = 0; i < n; i++) {
            printf("%d ", a[i]);
        }
    }else if (op == 1) {
        for (int i=n-1; i>=0; i--) {
            printf("%d ", a[i]);
        }
    }
    return 0;
}