qsort

快速排序

代码实现

#include<iostream>
#include<algorithm>
using namespace std;

void qsort(int arr[], int left, int right) {
    if(left < right) {
        int i = left;
        int j = right;
        arr[0] = arr[left];
        while(i < j) {
            while(i < j && arr[0] <= arr[j]) j--;
            arr[i] = arr[j];
            while(i < j && arr[0] >= arr[i]) i++;
            arr[j] = arr[i];
        }
        arr[i] = arr[0];
        qsort(arr, left, i-1);
        qsort(arr, i+1, right);
    }
}

void print(int arr[], int n) {
    for(int i = 1; i <= n; i++) cout << arr[i] << " ";
    cout << endl;
}

int main() {
    int n;
    cin >> n;
    int a[n+1];
    for(int i = 1; i <= n; i++) cin >> a[i];
    qsort(a, 1, n);
    print(a, n);
    return 0;
}