冒泡排序代码

#include <stdio.h>

void bubble(int arr1[ ], int len)
{
	int c = 1;
	for (int a = 0; a < len - 1; a++)
	{

		for (int b = 0; b < len - 1 - a; b++)
		{ 
			if (arr1[b] > arr1[b + 1])
			{
				int temp = arr1[b];
				arr1[b] = arr1[b + 1];
				arr1[b + 1] = temp;
				c = 0;                     //用于判断后面循环是否已有序，减少空间消耗
			}
		}
		if (c == 1)                            
		{
			break;
		}

	}
}

int main()
{
	int n = 0;
	int arr[ ] = {9,8,7,6,5,4,3,2,1,0 };
	n = sizeof(arr) / sizeof(arr[0]);
	bubble(arr, n);
	for (int m = 0; m < 10; m++)
	{
		printf("%d ", arr[m]);
	}
	return 0;
}