#include
void bsort(int a[], int n) //a输入的数组，n是数组长度
{
int i,j,k;
for (i=0;i {
for (j=0;j if (a[j] > a[j+1])
{
k=a[j];
a[j]=a[j+1];
a[j+1]=k;
}
}
}
int main()
{
int a[1000],n;
scanf("%d", &n);
int i;
for (i=0;i scanf("%d", &a[i]);
bsort(a,n);
for (i=0;i printf("%d ", a[i]);
return 0;
}
