mergesortl.cpp

归并排序

#include "MergeSortL.h"

template<class T>void MergeSortL(T a[],int left,int right,int pointer)
{
	T * Link=new T[right-left+1];
	int q,r;
	if(right-left+1<8)
	   InsertionSort(a,left,right);
	else
	{
		int mid=(left+right)/2;
		MergeSortL(a,left,mid,q);
		MergeSortL(a,mid+1,right,r);
		MergeL(a,q,r,pointer);
	}
}

template<class T>void MergeL(T a[],int q,int r,int pointer)
{
	
}