C++类型模板对一个具有n个Type类型的一维数组进行排序

 编写如下形式的模板: template<class Type>void sort(Type* A, int n, bool f)
对一个具有n个Type类型的一维数组进行排序，f为1表示从小到大排序，f为0表示从大到小排序

#include "iostream"
using namespace std;

template <class T>void kuaipai(T* A, int left, int right,bool f) {

	//快速排序
	if (f) {
		//从小到大排序
		if (left > right) return;
		int i = left + 1, j = left;
		T temp = A[left];
		while (i <= right) {

			if (A[i] < temp && ++j != i)
				swap(A[j], A[i]);
			++i;
		}
		swap(A[left], A[j]);
		kuaipai(A, left, j - 1,f);
		kuaipai(A, j + 1, right,f);
	}
	else {
		//从大到小排序
		if (left > right) return;
		int i = left + 1, j = left;
		T temp = A[left];
		while (i <= right) {

			if (A[i] > temp && ++j != i)
				swap(A[j], A[i]);
			++i;
		}
		swap(A[left], A[j]);
		kuaipai(A, left, j - 1,f);
		kuaipai(A, j + 1, right,f);
	}


}

template<class T>void sort(T* A, int n, bool f)
{
	kuaipai(A, 0, n - 1, f);
}




int main() {

	int a[6] = { 5,6,4,9,2,1 };
	cout << "排序前：" << endl;
	for (int i = 0; i < 6; i++) {
		cout << a[i] << " ";
	}
	cout << endl;
	sort<int>(a, 6, 0);
	cout << "大到小排序后：" << endl;
	for (int i = 0; i < 6; i++) {
		cout << a[i] << " ";
	}
	cout << endl;
	sort<int>(a, 6, 1);
	cout << "小到大排序后：" << endl;
	for (int i = 0; i < 6; i++) {
		cout << a[i] << " ";
	}
	cout << endl;

}