BubbleSort 改编版的改编

#include<bits/stdc++.h>
using namespace std;
const int MAXN=1000;
int FLAG,n,L[MAXN],k;
int BubbleSort()
{
FLAG=n;
while(FLAG>1)
{
k=FLAG-1;
FLAG=1;
for(int j=1;j<=k;j++)
{
if(L[j]>L[j+1])
{
swap(L[j],L[j+1]);
FLAG=j;
}
}
}
}
int main()
{
cout<<setw(40)<<“BubbleSort!!!”<<endl<<endl;
cout<<setw(37)<<“Times!!!”<<endl<<endl;
cout<<setw(31)<<" “;
cin>>n;
cout<<setw(39)<<“Numbers!!!”<<endl<<endl;
cout<<setw(30)<<” “;
for(int i=1;i<=n;i++)
{
cin>>L[i];
}
BubbleSort();
cout<<setw(38)<<“Answer!!!”<<endl<<endl;
cout<<setw(30)<<” “;
for(int i=1;i<=n;i++)
{
cout<<L[i]<<” ";
}
return 0;
}