写冒泡排序可以排序一个整型数组

void bubbsort(int *arr,int len)
{
	int flag = 0;
	assert(arr);
	for (int i = 0; i < len - 1; i++)
	{
		for (int j = 0; j < len - i - 1; j++)
		{
			flag = 1;
			if (arr[j]>arr[j + 1])
			{
				swap(arr[j],arr[j+1]);
			}
		}
		if (flag == 0)
			break;
	}
}
int main()
{
	int arr[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 43, 4, };
	
	
	bubbsort(arr, 12);
	
	for (size_t i = 0; i < 12; i++)
	{
		printf("%d ", arr[i]);
	}
}