#include<iostream>
using namespace std;
int Merge(int Sumarray[],int Larray[],int Llength,int Rarray[],int Rlength){
int i=0,j=0,k=0;
while ((i<Llength+1)&&(j<Rlength+1))
{
if (Larray[i]<=Rarray[j])
{
Sumarray[k]=Larray[i];
i++;
}else
{
Sumarray[k]=Rarray[j];
j++;
}
k++;
}
if (i==Llength+1)
{
while (j<Rlength+1)
{
Sumarray[k]=Rarray[j];
j++;
k++;
}
}
else
{
while (i<Llength+1)
{
Sumarray[k]=Larray[i];
i++;
k++;
}
}
return 0;
}
int Mergesort(int Inputarray[],int nLow,int nHigh){
if ((nHigh-nLow+1)>1){
int nMid = (nLow+nHigh+1)/2;
int* nLeft = new int[nMid];
int* nRight = new int[nHigh - nMid + 1];
for (int i = 0; i < nMid; i++)
{
nLeft[i] = Inputarray[i];
}
for (int j = 0 ; j < (
C++合并排序算法
最新推荐文章于 2024-05-15 01:12:59 发布
![](https://img-home.csdnimg.cn/images/20240711042549.png)