【数据结构】选择排序

#define _CRT_SECURE_NO_WARNINGS
#include<iostream>

template<class elemType>
void swap(elemType* a, elemType* b)
{
	int tmp = *a;
	*a = *b;
	*b = tmp;
}

//时间复杂度O(N^2),空间复杂度O(1)
void Select_Sort(int* arr, int n)
{
	
	for (int i=0;i<n;++i)
	{
		int min_index = i;
		//每一趟找出一个最小值；
		for (int j=i;j<n;++j)
		{
			if (arr[j] < arr[min_index])
			{
				min_index = j;

			}

		}

		swap(&arr[i],&arr[min_index]);
	}


}

int main()
{
	int array[10] = { 10,9,8,7,6,5,4,3,2,1 };
	Select_Sort(array, 10);
	for (auto& e : array)
	{
		std::cout << e << std::endl;
	}
	return 0;
}