qsort

#include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <set>

using namespace std;

int a[5000010];

void qsort(int l, int r)
{
    int i = l, j = r;
    srand(r);
    long d = a[(rand() % (r - l + 1)) + l];
    do
    {
        while (a[i]>d)
            i++;
        while (a[j]<d)
            j--;
        if (i <= j)
        {
            swap(a[i], a[j]);
            i++;
            j--;
        }
    } while (i <= j);
    if (l < j)
        qsort(l, j);
    if (r > i)
        qsort(i, r);
}

int main()
{
    int n;
    cin >> n;
    for (int i = 0; i < n; i++)
        cin >> a[i];

    qsort(0, n - 1);


    for (int i = 0; i < n; i++)
        cout << a[i] << " ";
    //system("PAUSE");

    return 0;
}