冒泡排序

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
void bubsort(int *a){
	for(int i=1;i<=5-1;i++){
		for(int j=1;j<=5-i;j++){
			if(a[j]>a[j+1])
				swap(a[j+1],a[j]);
		}
	}
	return ;
}
int main(){
	int a[6]={0,9,5,1,3,7};
	bubsort(a);
		for(int i=1;i<=5;i++)
			cout<<a[i]<<" ";	
	return 0;
}