冒泡排序

void bubbleSort(int k[], int n)
{
	int i, j, temp;
	for( i = 0;i < n-1; i++ )
	{
		for( j = i+1;j < n; j++ )
		{
			if( k[i] > k[j] )
			{
				temp = k[j];
				k[j] = k[i];
				k[i] = temp;
			}
		}
	}
}
 
bubbleSort(a,10);