题解 | 【模板】排序

#include <stdio.h>
void qsort(int left, int right, int array[]) {
    int i, j;
    int middle, temp;
    i = left;
    j = right;
    middle = array[(left + right) / 2];
    do {
        while ((array[i] < middle) && (i <= right))
            i++;
        while ((array[j] > middle) && (j >= left))
            j--;
        if (i <= j) {
            temp = array[i];
            array[i] = array[j];
            array[j] = temp;
            i++;
            j--;
        }

    }while(i<=j);
    if(left<j)

    qsort(left,j,array);
    if(right>i)
    qsort(i,right,array);

}
int main() {
    int n;
    scanf("%d", &n);
    int a[n];
    for(int i=0;i<n;i++)scanf("%d ",&a[i]);
    qsort(0,n-1,a);
    for (int i = 0; i < n; i++) printf("%d ", a[i]);
    printf("\n");
    return 0;
}