//算法1：经典快排

include[HTML_REMOVED]

include[HTML_REMOVED]

using namespace std;
const int N = 1e7 + 10;
int a[N];
int n;
void qs(int a[], int L, int R)
{
if (L >= R)return;
int x = a[L + R >> 1], i = L - 1, j = R + 1;
while (i < j) {
do i; while (a[i] < x);
do j–; while (a[j] > x);
if (i < j)swap(a[i], a[j]);
}
qs(a, L, j);
qs(a, j+1, R);
}
int main()
{
int i;
cin >> n;
for (i = 0; i < n; i)
scanf(“%d”,&a[i]);
qs(a, 0, n - 1);
for (i = 0; i < n; i++)
printf(“%d “,a[i]);
return 0;
}
//算法2：调用algorithm函数

include[HTML_REMOVED]

include[HTML_REMOVED]

using namespace std;
const int N = 1e7 + 10;
int a[N];
int n;
int main()
{
int i;
cin >> n;
for (i = 0; i < n; i)
scanf(“%d”, &a[i]);
sort(a, a + n);
for (i = 0; i < n; i)
printf(“%d “, a[i]);
return 0;
}