例:A={3,5,7,8,9,12,16}
B={2,4,7,9,11}
out:{2,3,4,5,7,7,8,9,12,16}
#include<stdio.h>
#define M 7
#define N 5
void Merge(int a[],int b[],int c[])
{
int i,j,k;
i=j=k=0;
while(i<M&&j<N){//比较a【i】与b【j】元素大小存入数组c中
if(a[i]>b[j]){
c[k++]=b[j++];
}
else c[k++]=a[i++];
}
if(i<M){//a没完,b完了
while(i<M){
c[k++]=a[i++];
}
}
else {//b没完,a完了
while(j<N){
c[k++]=b[j++];
}
}
}
int main()
{
int a[M]={3,5,7,8,9,12,16};
int b[N]={2,4,7,9,11};
int c[M+N];
Merge(a,b,c);
for(int i=0;i<M+N;i++)
printf("%5d",c[i]);
return 0;
}
#include<stdio.h>
#define M 7
#define N 5
void Merge(int a[],int b[],int c[])
{
int i,j,k,len,t;
int *s;
i=j=k=0;
while(i<M&&j<N){
if(a[i]>b[j]){
c[k++]=b[j++];
}
else c[k++]=a[i++];
}
if(i<M){//a没完,b完了
s=a;t=i;len=M; //去掉i仅留t
}
else{
s=b;t=j;len=N; //去掉j仅留ti
}
while(t<len){ //比较t,用指针s完成值的赋予
c[k++]=s[t++]; //t->i
}
}
int main()
{
int a[M]={3,5,7,8,9,12,16};
int b[N]={2,4,7,9,11};
int c[M+N];
Merge(a,b,c);
for(int i=0;i<M+N;i++)
printf("%5d",c[i]);
return 0;
}
#include<stdio.h>
#define M 7
#define N 5
void Merge(int a[],int b[],int c[])
{
int i,j,k,len=M;
i=j=k=0;
int *s=a;
while(i<M&&j<N){
if(a[i]>b[j]){
c[k++]=b[j++];
}
else c[k++]=a[i++];
}
if(j<M); //a没完,s已经在a上指着,不移动指针i
else {s=b;i=j;len=N;} //b没完,指针移动
while(i<len){
c[k++]=s[i++];
}
}
int main()
{
int a[M]={3,5,7,8,9,12,16};
int b[N]={2,4,7,9,11};
int c[M+N];
Merge(a,b,c);
for(int i=0;i<M+N;i++)
printf("%5d",c[i]);
return 0;
}
#include<stdio.h>
#define M 7
#define N 5
void Merge(int a[],int b[],int c[])
{
int i,j,k;
i=j=k=0;
while(i<M||j<N){//不管谁先完
if(j>=N||(i<M&&a[i]<b[j])){//b没完,a没完,判断||后面,i没完
c[k++]=a[i++]; //b完了,赋值a剩下的元素
}
else c[k++]=b[j++];//a【i】>=b[j]或者a完了,b么完
}
}
int main()
{
int a[M]={3,5,7,8,9,12,16};
int b[N]={2,4,7,9,11};
int c[M+N];
Merge(a,b,c);
for(int i=0;i<M+N;i++)
printf("%5d",c[i]);
return 0;
}