/*给定一个长度为n的数列,将这个数列按从小到大的顺序排列。1<=n<=200*/
#include <iostream>
#include <cmath>
using namespace std;
template<class T>
void bubblesortswap(T& x, T& y)
{
T temp = x;
x = y;
y = temp;
}
template<class T>
void Bubblesort(T* a, int n)
{
int i = n - 1;
while (i > 0)
{
int lastExchangeIndex = 0;
for (int j = 0; j < i; j++)
{
if (a[j + 1] < a[j])
{
bubblesortswap(a[j], a[j + 1]);
lastExchangeIndex = j;
}
i = lastExchangeIndex;
}
}
}
int main()
{
int n=0;
cin >> n;
int *a=new int[n];
for (int i = 0; i < n; i++)
{
cin >> a[i];
}
Bubblesort(a, n);
for (int i = 0; i < n; i++)
{
cout << a[i]<<" ";
}
cout << endl;
delete[]a;
return 0;
}