排序算法：冒泡排序

#include<iostream>
#include<vector>
using namespace std;
void BubbleSort(int a[], int n)
{
	int flag = 1;
	while (n >0 &&flag == 1)
	{
		flag = 0;
		for (int i = 0; i < n; i++)
		{
			if (a[i] > a[i + 1])
			{
				flag = 1;
				swap(a[i], a[i + 1]);
			}
		}
		n--;
	}
}
int main()
{
	int a [11] = { 2,6,4,5,54,53,53,5,34,34,32};
	BubbleSort(a, 10);
	for (int i = 0; i < 11; i++)
	{
		cout << a[i] << " ";
	}
	return 0;
}