每日练习序5.6算法（泡沫和选择性）

冒泡排序

int main()
{
	int j = 0, i = 0;
	int n = 0;
	int arr[] = { 9,5,4 };
	for (j = 0; j < 3; j++)
	{
		for (i = 2; i >= j; i--)
		{
			if (arr[i] < arr[i - 1])
			{
				int temp = arr[i];
				arr[i] = arr[i - 1];
				arr[i - 1] = temp;
			}
		}
	}
	for (n = 0; n < 3; n++)
		printf("%d ", arr[n]);
	return 0;
}

选择排序

int main()
{
	int arr[] = { 5,9,41,63,33 };
	for (int i = 0; i < 4; i++)
	{
		int temp = arr[i];
		int ipos = i;

		for (int j = i + 1; j < 5; j++)
		{
			if (arr[j] > temp)
			{
				temp = arr[j];
				ipos = j;
			}
		}
		arr[ipos] = arr[i];
		arr[i] = temp;
	}
	for (int n = 0; n < 5; n++)
		printf("%d ", arr[n]);
	return 0;
}