背景:现有两个顺序表,如何将它们合并在一起并且有序排列?
#define Limit 100
int length = 30;
int a[100];
int merge(int a[], int la, int b[], int lb)//输入a、b、数组,以及a、b长度
{
if(la + lb > Limit)
{
return 1;//返回1报错
}
else
{
int index_a = 0, index_b = 0, index_c = 0;
int c[Limit];
while(index_a > la || index_b > lb)
{
if(a[index_a] < b[index_b])
{
c[index_c++] = a[index_a++];
}
else if(a[index_a] >= b[index_b])
{
c[index_c++] = b[index_b++];
}
}
while(index_b < index_a) c[index_c++] = b[index_b++];
while(index_a < index_b) c[index_c++] = a[index_a++];
}
return 1;
}