quicksort.h

有各种排序算法

#ifndef QUICKSORT_H
#define QUICKSORT_H
#include"DataList.h"
template<class T>
void QuickSort(dataList<T>& L,const int left,const int right)
{
	if(left < right)
	{
		int pivotpos = L.Partition2(left,right);
		cout << L << endl;
		QuickSort(L,left,pivotpos-1);
		
		QuickSort(L,pivotpos+1,right);
		//cout << L << endl;
	}
}
#endif