复习之路 冒泡排序

#include <iostream>
using namespace std;
int main()
{
	int sz[10]={1,4,5,2,543,4,3,5,2,4};
 int m,i,b,j,c;
		for (j=0;j<=8;++j)
		for (i=0;i<=9-j;++i)
			for (b=0;b<9;++b)
		{
			if (sz[b]>=sz[b+1])
			{
				c=sz[b];
				sz[b]=sz[b+1];
				sz[b+1]=c;
			}
		}
		for (m=0;m<=9;++m)
		{
			cout<<sz[m]<<endl;
	}
	return 0;
}