排序算法6--选择类排序1--简单选择排序（C++完整代码实现）

#include <iostream>
using namespace std;
int main()
{
	//简单选择排序
	int R[] = {8, 9, 10, 11, 0};
	int n = 5;
	int temp, pos;
	for (int i = 0; i < n; ++i)
	{
		temp = R[i];
		pos = i;
		for (int j = i + 1; j < n; ++j)
		{
			if (R[j] < temp)
			{
				temp = R[j];
				pos = j;
			}
		}
		//找到无序序列中最小的值,位置在pos
		R[pos] = R[i];
		R[i] = temp;	
	}
	//排序已完成，打印出来看看👀
	for (int i = 0; i < n; ++i)
		cout << R[i] << endl;
	return 0;
}

简单选择排序的时间复杂度O（n^2）