选择排序（纯代码）不推荐使用

	#include<iostream>
#include<string>
using namespace std;
template <class T>
void swrap(T &a, T &b) {
	T temp =b;
	b = a;
	a = temp;

}

template<class T>
void put(T* a, int length) {
	for (int i = 0; i < length; i++)
	{
		cout << a[i] << " ";
	}
}

template <class T>
void sort(T* a,int length) {//运用选择排序 进行数组的从小大大排序

	for (int  i = 0; i < length; i++)
	{
		int min = i;
		for (int j = i+1; j < length; j++)
		{
			if (a[j] < a[min]) {
				min = j;
			}
		}
		if (min != i) {
		
			swrap(a[i], a[min]);
		}
	}

}

int main()//随机函数
{
	char a[] = { "gfedcba" };
	int length = sizeof(a) / sizeof(a[0]);
	sort<char>(a, length);
	put<char>(a, length);

}