数组合并 http://wenwen.soso.com/z/q169244363.htm

http://wenwen.soso.com/z/q169244363.htm

#include <iostream.h>
const int M=7;
const int N=4;
void Merge_sort(int a[],int an,int b[],int bn)
{
int c[M+N]={0};
int i=0,j=0,k=0;
while(i<an&&j<bn)
{
if(a[i]<=b[j])
{
c[k]=a[i];
i++; k++;
}
else 
{
c[k]=b[j];
j++; k++;
}
}
while(j<bn)
{
c[k++]=b[j++];
}

while(i<an)
{
c[k++]=a[i++];
}

for( i=0;i<M+N;i++)
cout<<c[i]<<" ";
cout<<endl;
}
void main()
{
int a[M]={7,12,15,20,26,45,52};
int b[N]={4,8,10,17};
Merge_sort(a,M,b,N);
}

 

 

程序执行结果：