Bubble sort Starter Edition

Bubble sort Starter Edition

void bubble_sort(int arr[], int sz)
{
	int i = 0;
	//外层循环冒泡排序的趟数
	for (i = 0; i < sz - 1; i++)
	{
		int j = 0;
		for (j = 0; j <sz-1-i;j++)
		{
			//一对元素的比较
			if (arr[j]>arr[j + 1])
			{
				int tmp = arr[j];
				arr[j] = arr[j + 1];
				arr[j + 1] = tmp;
			}
		}

	}

}

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

//冒泡排序
int main()
{
	int arr[] = { 9, 8, 7, 6, 5, 4, 3, 2, 1, 0 };
	int sz = sizeof(arr) / sizeof arr[0];
	
	pritn_arr(arr, sz);
	printf("\n");
	bubble_sort(arr, sz);
	pritn_arr(arr, sz);

	system("pause");
	return 0;
}

Simple optimization improvements(In ascending)

Plus a flag

void bubble_sort(int arr[], int sz)
{
	int i = 0;
	int flag = 0;//注意这里
	
	//外层循环冒泡排序的趟数
	for (i = 0; i < sz - 1; i++)
	{
		int j = 0;
		for (j = 0; j <sz-1-i;j++)
		{
			//一对元素的比较
			if (arr[j]>arr[j + 1])
			{
				int tmp = arr[j];
				arr[j] = arr[j + 1];
				arr[j + 1] = tmp;
				flag = 1;
			}
			if (0 == flag)
				break;
		}

	}

}

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

//冒泡排序
int main()
{
	int arr[] = { 0,1,2,3,4,5,6,7,8,9 };
	int sz = sizeof(arr) / sizeof arr[0];
	pritn_arr(arr, sz);
	printf("\n");
	bubble_sort(arr, sz);
	pritn_arr(arr, sz);

	system("pause");
	return 0;
}

Ways to Improve
0123456789 row itself is good for
Yi Tangtang comparison really is not worth it.
Go on a trip, then pairwise comparison, if you perform the exchange flag = 1;
can in fact did not enter the exchange statement, then flag = 0;
therefore compares trip is enough, no trip to visit has been par.

flag=0
if (0 == flag)
break;

Replay

Today saw a word, I feel that is me.
About self-discipline, you often pick up, always discarded.
Really quite ashamed of. Again and again like this, feel is not cool.