C++实现两路合并算法

#include <iostream>

using namespace std;

void Merge(int *a, int l, int m, int r){
    int n1= m - l + 1;                    //左边节点个数
    int n2 = r - m ;                      //右边节点个数
    int *L = new int[n1+1];               //生成左边一路
    int *R = new int[n2+1];               //生成右边一路
    int i ,j , k;
    for(i = 0; i < n1; i++){              //将原数组拷贝到左路
        L[i] = a[l + i];
    }
    for(j = 0; j < n2; j++){              //将原数组拷贝到右路
        R[j] = a[m + j + 1];
    }

    for(i = 0, j = 0,k = l; k <= r; k++){    //将左右两路中元素排序重组后
        if(L[i] <= R[j]){                    //重新拷贝到原数组
            a[k] = L[i++];
        }
        else{
            a[k] = R[j++];
        }
    }
    delete []L;                               //释放空间
    delete []R;
}

void MergeSort(int *a, int l, int r){
    if(l<r){
         int m = (l + r) / 2;                  //找到数组中间数m
    MergeSort(a, l, m);
    MergeSort(a, m+1, r);                      //不断递归，从大分解到小
    Merge(a, l, m, r);
    }
}

int main()
{
    int a[10] = {0,9,8,6,4,3,1,5,2,7};
    for(int i = 0; i < 10; i++){
        cout<<a[i]<<" ";
    }
    cout<<endl;
    MergeSort(a,0,9);                //开始两路合并算法
    for(int i = 0; i < 10; i++){
        cout<<a[i]<<" ";
    }
    return 0;
}

可视化合并算法视频链接：
https://www.bilibili.com/video/BV1AW411178f?t=71