有序数组的合并

#include<stdio.h>
#include<malloc.h>
#define MAXSIZE 50


typedef struct{
int a[MAXSIZE];
int last;
}Seqlist;


Inithanshu(Seqlist *s,Seqlist *s2)
{
int i=0;


    s->last=3;
s2->last=6;

for(i=0;i<=s->last;i++)
{
s->a[i]=i;
}


for(i=0;i<=s2->last;i++)
{
s2->a[i]=i;
}

}
hebing(Seqlist *s1,Seqlist *s2,Seqlist *s3)
{
int i=0,j=0,k=0;


while(i<=s1->last && j<=s2->last)
{
if(s1->a[i]<s2->a[j])
{
s3->a[k]=s1->a[i];
k++;
i++;  
}
if(s1->a[i]>=s2->a[j])
{
s3->a[k]=s2->a[j];
k++;
j++;  
}
}
while(i>s1->last&&j<=s2->last) 
{
s3->a[k]=s2->a[j];
k++;
j++;
}
while(i<=s1->last&&j>s2->last)
{
s3->a[k]=s2->a[i];
k++;
i++;
}
s3->last=s1->last+s2->last+1;
}
void main()
{ 
int i;
Seqlist *s;
Seqlist *s2;
Seqlist *s3;


s=(Seqlist *)malloc(sizeof(Seqlist));
  s2=(Seqlist *)malloc(sizeof(Seqlist));
s3=(Seqlist *)malloc(sizeof(Seqlist));


Inithanshu(s,s2);
hebing(s,s2,s3);
    for(i=0;i<=s3->last;i++)
{
printf("%d",s3->a[i]);
}
}