冒泡排序

code:

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
//冒泡排序 
int main(){
	int i,j,k;
	int n,head=1;
	int a[100055];
		cin>>n; 
	for(i=1;i<=n;i++){
		cin>>a[i];
	}
/*while循环实现
	while(head<=n){
			for(i=head+1;i<=n;i++){
		if(a[head]>a[i]) swap(a[head],a[i]);
				}
				head++;
		}
*/
for(i=1;i<=n;i++){
	for(j=i+1;j<=n;j++){
		if(a[i]>a[j])swap(a[i],a[j]);
	}
}
			for(i=1;i<=n;i++){
			cout<<a[i];

	}


	return 0;
}