将两个长度不超过10的有序整数集合A和B合并为一个有序整数集合C。请用数组（顺序存储结构）表示这两个集合

#include
void read(int a[],int n)
{
int i;
for(i=0;i}
int main()
{
int a[1000],b[1000],c[2000];
int n,m,j,i,k=0;
scanf("%d%d",&n,&m);//输入两个数组的长度
read(a,n);//读入a数组
read(b,n);//读入b数组
i=0;
j=0;
while(i {
while(i {
c[k++]=a[i];
i++;
}
while(i {
c[k++]=b[j];
j++;
}
}
while(i {
c[k++]=a[i];
i++;
}
while(j {
c[k++]=b[j];
j++;
}
for(i=0;i puts("");
return 0;
}

//其实可以在上一个人基础上做一下修改，会更简单
#include
#include
void read(int a[],int n)
{
int i;
for(i=0;i scanf("%d",&a[i]);
a[n]=INT_MAX; //增加哨兵，方便处理边界条件
}
int main()
{
int a[1000],b[1000],c[2000];
int n,m,j,i,k=0;
scanf("%d%d",&n,&m);//输入两个数组的长度
read(a,n);//读入a数组
read(b,m);//读入b数组
i=0;
j=0;
for(k=0;k if(a[i] {
c[k]=a[i];
i++;
}
else
{
c[k]=b[j];
j++;
}
for(i=0;i printf("%d ",c[i]);
printf("\n");
return 0;
}

#include
#include
/*线性表*/
struct TLink {
int data;
struct TLink * next;
};/*end struct TLink*/

/*生成新元素*/
struct TLink * new_item(int number)
{
struct TLink * r = 0;
r = (struct TLink *)malloc(sizeof(struct TLink));
r->data = number;
r->next = 0;
return r;
}/*end new_item*/

/*在线性表中查询数据*/
struct TLink * lookup(struct TLink * root, int number)
{
struct TLink * h = root;
while(h) {
if (h->data == number) return h;
h = h->next ;
}/*end lookup*/
return 0;
}

/*在线性表中追加一个数据*/
void append(struct TLink * * root, int number)
{
struct TLink * r = 0, * n = 0;
if (!root) return ;

/*不记录重复元素*/
if (lookup(*root, number)) return;

/*如果表为空则新建表*/
r = *root;
if (!r) {
*root = new_item(number);
return ;
}/*end if*/

/*为保证为有序线性表，如果数据比表头还小则作为表头*/
if (number r->data ) {
n = new_item(number);
n->next = r;
*root = n;
return ;
}/*end if*/

/*在有序线性表中查找位置插入元素*/
while(r) {
n = r->next ;

/*如果已经是表尾则直接追加*/
if (!n) {
n = new_item(number);
r->next = n;
return ;
}/*end if*/

/*在中央某处插入*/
if (number n->data ) {
r->next = new_item(number);
r->next->next = n;
return ;
}/*end if*/
r = n;
}/*end while*/
}/*end append*/

/*打印有序线性表*/
void print(struct TLink * root)
{
struct TLink * r = root;
printf("【");
while(r) {
printf("%d ", r->data );
r = r->next ;
}/*end while*/
printf("\b】\n");
}/*end print*/

/*将有序线性表h1合并至有序线性表h0，并销毁线性表h1*/
void merge(struct TLink ** h0, struct TLink ** h1)
{
struct TLink * h = 0, * k = 0;
if (!h0 || !h1) return ;
h = *h1;
while(h) {
append(h0, h->data );
k = h;
h = h->next ;
free(k);
}/*end h*/
h1 = 0;
}

int main(void)
{
int i = 0; struct TLink * x=0, *y = 0;
int a[] = {8,4,3,9,5,1};
int b[] = {7,2,1,5,6,0};
printf("原数据为：\n数组A：【");
for(i = 0; i < 6; i++) {
printf("%d ", a[i]);
append(&x, a[i]);
}/*next*/
printf("\b】\n数组B：【");
for(i = 0; i < 6; i++) {
printf("%d ", b[i]);
append(&y, b[i]);
}/*next*/
printf("\b】\n转换为有序线性表\nA：");
print(x);
printf("B：");
print(y);
printf("AB合并后为：");
merge(&x, &y);
print(x);
return 0;
}
/*数组的太简单了，我就不写了！！！*/