冒泡排序

void sort(int* a, int n)
{
	int i = 0;
	int j = 0;
	for (i = 0; i < n-1; i++)
	{
		for (j = i ; j < n -1; j++)
		{
			if (a[j] > a[j+1])
			{
				int tmp = a[j];
				a[j] = a[j+1];
				a[j + 1] = tmp;
			}
		}
	}
}