# include <stdio.h>
void swap(int a[],int l, int r)//交换l与r的值
{
int temp;
temp = a[l];
a[l] = a[r];
a[r] = temp;
}
void Quicksort(int a[],int begin, int end)
{
if (begin >= end)
return;
int l, r, key;
l = begin;
r = end;
key = a[l];
while (l < r)
{
while (r > l && a[r] >= key)//从r开始往左边寻找小于key的值
--r;
while (l < r && a[l] < key)//从l开始往右边寻找大于等于key的值
++l;
swap(a,l,r);
}//执行完毕之后,a[r] == key;
Quicksort(a,begin,r - 1);//key值左边的数组排序
Quicksort(a,r + 1, end);//key值右边的数组排序
}
int main()
{
int a[100];
int n;
scanf("%d",&n);
for (int i = 0; i < n; i++)
scanf("%d",&a[i]);
Quicksort(a, 0,n - 1);
for (int i = 0; i < n; i++)
printf("%d ",a[i]);
printf("\n");
return 0;
}
void swap(int a[],int l, int r)//交换l与r的值
{
int temp;
temp = a[l];
a[l] = a[r];
a[r] = temp;
}
void Quicksort(int a[],int begin, int end)
{
if (begin >= end)
return;
int l, r, key;
l = begin;
r = end;
key = a[l];
while (l < r)
{
while (r > l && a[r] >= key)//从r开始往左边寻找小于key的值
--r;
while (l < r && a[l] < key)//从l开始往右边寻找大于等于key的值
++l;
swap(a,l,r);
}//执行完毕之后,a[r] == key;
Quicksort(a,begin,r - 1);//key值左边的数组排序
Quicksort(a,r + 1, end);//key值右边的数组排序
}
int main()
{
int a[100];
int n;
scanf("%d",&n);
for (int i = 0; i < n; i++)
scanf("%d",&a[i]);
Quicksort(a, 0,n - 1);
for (int i = 0; i < n; i++)
printf("%d ",a[i]);
printf("\n");
return 0;
}