选择排序

#include<iostream>
using namespace std;
#include<string>

template<class T>
void mySwap(T &a, T &b)
{
	T tmp;
	tmp = a;
	a = b;
	b = tmp;
}



template<class T>
void xuanze(T arr[], int len)
{

	for (int i = 0; i < len; i++)
	{
		int max = i;
		for (int j = i + 1; j < len; j++)
		{
			if (arr[max] < arr[j])
			{
				max = j;
			}
		}

		if (arr[max] != arr[i])
		{
			mySwap(arr[max], arr[i]);
		}
	}

}

template<class T>
void printArray(T arr[], int len)
{
	for (int i = 0; i < len; i++)
	{
		cout << arr[i] << " ";
	}
	cout << endl;
}

int main()
{

	char  charArr[] = "helloworld";
	int num = sizeof(charArr) / sizeof(char);

	xuanze(charArr, num);

	printArray(charArr,num);

	int myarr[5] = { 2, 5, 6, 1, 4 };
	num = sizeof(myarr) / sizeof(int);
	xuanze(myarr, num);

	printArray(myarr, num);

	system("pause");
	return 0;

}