1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
#include<iostream>
using namespace std;

const int N = 1e6 + 10;
int n;
int q[N];

void quick_sort(int q[],int l,int r){
    if(l>=r) return;
    int x = q[(l+r+1)/2 ],i = l-1,j = r+1;
    while(i<j){
        do i++ ;while(q[i]<x);
        do j-- ;while(q[j]>x);
        if(i<j) swap(q[i],q[j]);
    }
    quick_sort(q,l,j);
    quick_sort(q,j+1,r);
}

int main(){
    scanf("%d", &n);
    for(int i=0;i<n;i++) scanf("%d",&q[i]);

    quick_sort(q, 0 , n-1 );

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