冒泡排序

/**冒泡排序**/
#define N 10
#include<iostream>
using namespace std;

void BubbleSort(int a[])
{
	for (size_t i = 1; i <= 9; i++)
	{
		for (size_t j = 9; j >= i; j--)
		{
			if (*(a + j) < *(a + j - 1))
			{
				int temp = *(a + j);
				*(a + j) = *(a + j - 1);
				*(a + j - 1) = temp;
			}
		}

		cout << "第" << i << "趟：";
		for (size_t i = 0; i != 10; i++)
			cout << *(a + i) << " ";
		cout << endl;
	}
}

int main()
{
	int a[N];
	for (size_t i = 0; i != 10; i++)
		cin >> a[i];

	BubbleSort(a);

	cout << "排好后结果为：" << endl;
	for (size_t i = 0; i != 10; i++)
		cout << a[i] << " ";
}