冒泡排序（C++）

#include"iostream"
using namespace std;
void Swap(int &a,int &b)
{
	int temp = a;
	a = b;
	b = temp;
}
void Bubble_Sort(int a[],int n)
{
	for (int p = n - 1; p > 0; p--)
	{
		int flag = 0;
		for (int i = 0; i < p; i++)
		{
			if (a[i] > a[i + 1])
			{
				Swap(a[i],a[i+1]);
				flag = 1;
			}
		}
		if (flag == 0)
			break;
	}
}
int main()
{
	int n,a[100];
	cout << "请输入要排序的元素个数" << endl;
	cin >> n;
	cout << "请输入元素的具体值" << endl;
	for (int i = 0; i < n; i++)
	{
		cin >> a[i];
	}
	cout << "排序后" << endl;
	Bubble_Sort(a,n);
	for (int i = 0; i < n; i++)
	{
		cout << a[i] <<" ";
	}
	system("pause");
	return 0;
}