【四】 选择排序和冒泡排序的代码实现

#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
using namespace std;


//冒泡排序的实现  规则从大到小

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


//选择排序的实现，规则从小到大
void SelectSort(int * arr, int len)
{
	int temp = 0;
	for (int i = 0; i < len; i++)
	{
		int min = i;
		for (int j = i + 1; j < len; j++)
		{
			if (arr[j] < arr[min])
			{
				min = j;
			}
		}
		
		if (min != i)
		{
			temp = arr[min];
			arr[min] = arr[i];
			arr[i] = temp;
		}
	}
}


//数组的打印函数
void PrintArry(const int * arr, int len)
{
	for (int i = 0; i < len; i++)
	{
		cout << arr[i] << "  ";
	}
	cout << endl;
}

//测试接口
void test4()
{
	int arr1[] = { 0,1,2,3,4,5,6,7,8,9 };
	int len1 = sizeof(arr1) / sizeof(arr1[0]);
	
	cout << "冒泡排序结果：" << endl;
	BubbleSort(arr1, len1);
	PrintArry(arr1, len1);

	int arr2[] = { 9,8,7,6,5,4,3,2,1,0};
	int len2 = sizeof(arr1) / sizeof(arr1[0]);
	cout << "选择排序结果:" << endl;
	SelectSort(arr2, len2);
	PrintArry(arr2, len2);

}

int main()
{

	test4();

	system("pause");
	return EXIT_SUCCESS;
}