冒泡排序

冒泡排序  ，当进行从小到大的排序的时候，是将大的元素以冒泡的方式浮到最后。

#include<iostream>
using namespace std;

#define M 11
 
void Bubble(int a[])
{
	cout << "排序过程: " << endl;
	int temp;
	for (int i = 0; i < M - 1; i++)
	{
		for (int j = 0; j < M - 1 - i; j++)
		{
			if (a[j]>a[j + 1])
			{
				temp = a[j];
				a[j] = a[j + 1];
				a[j + 1] = temp;
			}
		}
		for (int k = 0; k < M; k++)
			cout << a[k] << " ";
		cout << endl;

	}
}
void main()
{
	cout << "--------------冒泡排序-------------" << endl;
	int a[M] = { 0, 102, 24, 24, 13, 1, 123, 111, 2344, 223, 123 };
	cout << "排序之前的元素为: \n";
	for (int i = 0; i < M; i++)
		cout << a[i] << " ";
	cout << endl;
	Bubble(a);
	cout << "排序结果为: \n";
	for (int i = 0; i < M; i++)
		cout << a[i] << " ";
	cout << endl;
}