排序（4）-快速排序

#include <iostream>
using namespace std;
const int N = 1000100;
int arr[N];
void quick_sort(int arr[], int l, int r)
{
    if (l >= r)return;
    int x = arr[(l+r)/2];
    int i = l - 1;
    int j = r + 1;
    while (i < j)
    {
        do i++; while (arr[i] < x);
        do j--; while (arr[j] > x);
        if (i < j)swap(arr[i], arr[j]);
    }
    quick_sort(arr, l, j);
    quick_sort(arr, j+1, r);
}

int main()
{
    
    int n;
    cin >> n;
    for (int i = 0; i < n; i++)
        scanf("%d", &arr[i]);
    quick_sort(arr, 0, n - 1);
    for (int i=0;i<n;i++)
        printf("%d ", arr[i]);
    return 0;
}