#include<iostream>
#include<cstdio>
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[r],i=l-1,j=r+1;
    while(i<j)
    {
        do ++i;while(q[i]<x);
        do --j;while(q[j]>x);

        if(i<j)
        {
            int t=q[i];
            q[i]=q[j];
            q[j]=t;
        }
    }

    quick_sort(q,l,i-1);
    quick_sort(q,i,r);
}

int main()
{
    cout << "请输入你要排序的个数：" ;
    cin >> n;

    cout << "排序前的顺序：" << endl;
    for(int i=0;i<n;i++) scanf("%d",&q[i]);

    quick_sort(q,0,n-1);


    cout << "排序后的顺序：" << endl;
    for(int i=0;i<n;i++)
    {
        cout << q[i] << " ";
    }

    return 0;
}