sort.h

各种排序算法BubbleSort、DichotomySort、HeapSort、InsertSort、MergeSort、QuickSort、ShellSort、

#ifndef SORT_H
#define SORT_H
#include<iostream.h>

template<class Elem>
class sort
{
	public:
		void Sorts(Elem Array[], int n);/////排序算法
		int compare(Elem x, Elem y);/////x>y返回1，x=y返回0，x<y返回-1
		void print(Elem Array[] , int n);/////打印排序结果
	protected:
		static void swap(Elem Array[], int x, int y);/////交换i\j
};
template<class Elem>
int sort<Elem>::compare(Elem x,Elem y)
{
	if(x > y) 
		return 1;
	else if(x == y) 
		return 0;
	else 
		return -1;
}
template<class Elem>
void sort<Elem>::print(Elem Array[] , int n)
{
	for(int i = 0 ; i < n ; i++)
	{
		if(i % 10 == 0)
			cout<<endl;
		cout<<Array[i]<<"  ";
	}
}
template<class Elem>
void sort<Elem>::swap(Elem Array[],int x,int y)
{
	Elem temp = Array[x];
	Array[x] = Array[y];
	Array[y] = temp;
}
#endif