Some

1. 冒泡排序

void swap( int &x, int &y )
{
	int c;
	c=x;
	x=y;
	y=c;
}
	int a[10] = { 9,0,3,4,3,5,6,7,8 };

	for( int i =0;i!=10;++i )
	{
		for( int j = i+1;j!=10;++j )
		{
			if( a[i]>a[j] )
			{
				swap( a[i],a[j] );
			}
		}
	}