合并排序

#include<iostream>
using namespace std;
template<typename type>void Merge(type a[],int l,int mid,int r);
template<typename type>void MergeSort(type a[],int l,int r);
int main()
{
    int m;
    cout<<"Please input the length of array which a:";
    cin>>m;
    char *a = new char[m];
    cout<<"Please input elements of array a:";
    for(int i = 0;i < m;i++)
        cin>>a[i];
    MergeSort(a,0,m-1);
    cout<<"Sequence of merge sorted array a:";
    for(int i = 0; i < m; i++)
        cout<<" "<<a[i];
    cout<<endl;
}
template<typename type>void MergeSort(type a[],int l,int r)
{
    if(l >= r)
        return;
    int mid = (l + r) / 2;
    MergeSort(a,l,mid);
    MergeSort(a,mid+1,r);
    Merge(a,l,mid,r);
}
template<typename type>void Merge(type a[],int l,int mid,int r)
{

    int len = r - l + 1;
    type *temp = new type[len];
    int l1 = l,l2 = mid + 1,k = 0;
    while(l1 <= mid && l2 <= r)
    {
        while(a[l1] <= a[l2] && l1 <= mid)  ///错误一：啊啊啊，累死我啦看了好长时间知道错误是越界，但还是不知道哪里错啦
            temp[k++] = a[l1++];
        while(a[l1] > a[l2] && l2 <= r)    ///又看了好长时间，才发现是l1,l2累加时越界。太生疏啦
            temp[k++] = a[l2++];
    }
    while(l1 <= mid)
        temp[k++] = a[l1++];
    while(l2 <= r)
        temp[k++] = a[l2++];
    for(k = 0; k < len; k ++)
        a[(l+k)] = temp[k];            ///错误二：l写成l1
    delete []temp;
}