#include "stdafx.h"
#include "iostream.h"
#define max 100
typedef struct list
{
int a[max];
int length;
}list;
void chushihua(list &l)
{
l.length=0;
}
void fuzhi(list &l)
{
int i=0;
cout<<"请输入"<<endl;
while(1)
{
cin>>l.a[i];
if(l.a[i]<0)
break;
else{l.length++;i++;}
}
}
void shuchu(list &l)
{
int i=0;
for(i=0;i<l.length;i++)
cout<<l.a[i]<<" ";
cout<<endl;
}
void hebin(list &la,list &lb,list &lc)
{
int la_len=la.length;
int lb_len=lb.length;
int i=0,j=0,k=0;
cout<<la_len<<endl<<lb_len<<endl;
while(i<la_len&&j<lb_len)
{
if(la.a[i]<=lb.a[j])
{
lc.a[k]=la.a[i];
i++;
k++;
lc.length++;
}
else
{
lc.a[k]=lb.a[j];
k++;
j++;
lc.length++;
}
}
while(i<la_len)
{
lc.a[k]=la.a[i];
i++;
k++;
lc.length++;
}
while(j<lb_len)
{
lc.a[k]=lb.a[j];
k++;
j++;
lc.length++;
}
//for(k=0;k<lc.length;k++)
// cout<<lc.a[k];
}
int main(int argc, char* argv[])
{
list la,lb,lc;
chushihua(lb);
chushihua(la);
chushihua(lc);
fuzhi(la);
fuzhi(lb);
hebin(la,lb,lc);
shuchu(lc);
return 0;
}
//在输入数组的时候,按从小到大输入,因为我没写排序函数,本人英语不好哈,不好意思啊。