冒泡排序算法

#include <iostream>
using namespace std;

typedef int T;

void sort(T a[], int n)
{
	bool bswap = false;
	do{
		bswap = false;
		for (int i=0; i<n-1; i++)
		{
			if (a[i+1] < a[i])
			{
				swap(a[i], a[i+1]);
				bswap = true;
			}
		}
	}while(bswap); 
} 

int main()
{
	T a[5] = {1, 4, 6, 2, 9};
	sort(a, 5);
	for (int i=0; i<5; i++)
		cout << a[i] << ' ';
	
	return 0;
}