经典排序算法——冒泡排序

#include<iostream>
using namespace std;
void printarray(int *a)
{
	int i;
	for (i = 0; i < 10; i++)
	{
		cout << "a[" << i << "]=" << a[i] << "  ";
		if ((i+1)%5==0)
		{
			cout << endl;
		}	
	}
}
int main()
{
	int i, j, tmp;
	int a[10] = { 12, 45, 46, 7, 8, 95, 64, 21, 78, 10 };
	printarray(a);
	cout << endl;
	for (i = 0; i < 10-1; i++)
	{
		for (j = 0; j < 10-i-1 ; j++)
		{
			if (a[j+1] < a[j])
			{
				tmp = a[j];
				a[j] = a[j+1];
				a[j+1] = tmp;
			}
		}
	}
	printarray(a);
	cout << endl;
	system("pause");
	return 0;
}

运行结果：