#include <iostream>
using namespace std;
const int N = 1e3 + 10;
int a[N];
int n;
int partition(int a[], int l, int r)
{
}
void QuickSort(int a[], int l, int r)
{
/结束条件/
if(l>=r) return;
int pos = partition(a, l, r);//记录枢轴的位置
}
int main()
{
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
QuickSort(a, 1, n);
return 0;
}
