【C语言】冒泡排序法

	//确定冒泡排序的趟数
	int i = 0;
	for (i=0;i
		int flag = 1; //假设这一趟有序
		//每一趟
		int j = 0;
		for(j=0;j
			if(arr[j]>arr[j+1])
			{
				int tmp = arr[j];
				arr[j] = arr[j+1];
				arr[j+1] = tmp;
				flag = 0;   //0代表本趟不是完全有序
			}
		}
		if (flag == 1)
		{
			break;
		}
	}


}


int main()
{	
	int arr[] = {1,2,2,1,1,4,5,7,6};
	int i = 0;
	int sz = sizeof(arr) / sizeof(arr[0]);
	//对arr排序成升序
	bubble_sort(arr,sz);
	for(i=0;i
		printf("%d ",arr[i]);
	}

	system("pause");
	return 0;
}