冒泡排序

//冒泡排序1;每一轮都跟每个数比较;
void maopao()
{
	int arr[12] = {2,6,5,7,44,33,55,94,57,84,1,83};
	for (int i = 0; i < 12; i++)
	{
		for (int j = 0; j < 12; j++)
		{
			if (arr[i] < arr[j])
			{
				int temp = arr[i];
				arr[i] = arr[j];
				arr[j] = temp;
			}
		}
	}

	for (int i = 0; i < 12; i++)
	{
		printf("%d  ",arr[i]);
	}
}
//冒泡排序2;每次从最后一个数往前比较，把最小的数放前面，然后剩下的数再做比较;
void maopao2()
{	
	int arr[12] = {2,6,5,7,44,33,55,94,57,84,1,83};

	for (int i = 0; i < 12; i++)
	{
		for (int j = 12 - 1; j > i; j--)
		{
			if (arr[j] < arr[j - 1])
			{
				int temp = arr[j];
				arr[j] = arr[j - 1];
				arr[j - 1] = temp;
			}
		}
	}

	for (int i = 0; i < 12; i++)
	{
		printf("%d  ",arr[i]);
	}
}