数据结构_冒泡排序

//////////////////////////////BubbleSort///////////////////////////////

void BubbleSort(int *arr, int n)
{
	int tmp;
	for (int i = 0; i < n - 1; i++)
	{
		for (int j = 0; j < n - i - 1; j++)
		{
			if (arr[j] > arr[j + 1])
			{
				tmp = arr[j];
				arr[j] = arr[j + 1];
				arr[j + 1] = tmp;
			}
		}
	}
}

int main(const int argc, const char *argv[])
{
	int a[10] {2.5, 0.6, 3, 1, 8, 5, 9, 4, 6, 7};
	
	for (int i = 0; i < 10; i ++)
	{
		if (i == 9)
		{
			printf("%d\n", a[i]);
		}
		else
		{
			printf("%d,", a[i]);
		}
	}
	BubbleSort(a, 10);
	for (int i = 0; i < 10; i++)
	{
		if (i == 9)
		{
			printf("%d\n", a[i]);
		}
		else
		{
			printf("%d,", a[i]);
		}
	}

	system("pause");
	return 0;
}