冒泡排序

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
using namespace std;
int main()
{
int n;
cin>>n;
int a[n+1];
for(int i=1;i<=n;i++)
cin>>a[i];
for(int i=1;i<=n-1;i++)
for(int j=1;j<=n-i;j++)
if(a[j]>a[j+1])
{
int s=a[j];
a[j]=a[j+1];
a[j+1]=s;
}
for(int i=1;i<=n;i++)
cout<<a[i]<<" ";
return 0;
}