code:
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int main(){
int a[100055];
int i,j,k;
int n,head=1;
cin>>n;
for(i=1;i<=n;i++){
cin>>a[i];
}
while(head<=n-1){
i=head+1;
while(i>=2&&a[i]<a[i-1]){
swap(a[i],a[i-1]);
i--;
}
head++;
}
for(i=1;i<=n;i++){
cout<<a[i];
}
}
code(1)
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int a[100055];
//插入排序
int main(){
int i,j,k;
int n;
cin>>n;
for(i=1;i<=n;i++){
cin>>a[i];
}
for(i=1;i<=n;i++){
for(j=i;j>=1;j--){
if(a[j]<a[j-1])swap(a[j],a[j-1]);
}
}
for(i=1;i<=n;i++){
cout<<a[i]<<" ";
}
return 0;
}