题解 | #牛牛的排序#

#include <stdio.h>
#include <stdlib.h>

int main() {
    int n;
    int *a;

    scanf("%d\n", &n);
    a = (int *)malloc(n * sizeof(int));
    for (int i = 0; i < n; i++) {
        scanf("%d ", &a[i]);
    }

    // 使用冒泡排序
    int tmp;
    for (int i = 0; i < n; i++) {
        for (int j = i; j < n; j++) {
            if (a[i] > a[j]) {
                tmp = a[i];
                a[i] = a[j];
                a[j] = tmp;
            }
        }   
    }

    for (int i = 0; i < n; i++) {
        printf("%d ", a[i]);
    }
    return 0;
}