1、已知la与lb是两个递增有序的顺序表,要求写一个算法,构造递增有序表lc,表中的元素由la与lb合并后得到。求代码及其讲解讲解讲解
1 回答

Will_木
TA贡献16条经验 获得超2个赞
Status MergeList_Sq(SqList La,SqList Lb, SqList &Lc)
{
InitList_Sq(Lc);
int i=1,j=1,k=0;
int ai,bj;
while((i<=La.length)&&(j<=Lb.length))
{
GetElem(La,i,ai);
GetElem(Lb,j,bj);
if(ai<=bj)
{
ListInsert_Sq(Lc,++k,ai);
i++;
}
else
{
ListInsert_Sq(Lc,++k,bj);
j++;
}
}
while(i<=La.length)
{
GetElem(La,i++,ai);
ListInsert_Sq(Lc,++k,ai);
}
while(j<=Lb.length)
{
GetElem(Lb,j++,bj);
ListInsert_Sq(Lc,++k,bj);
}
}
- 1 回答
- 0 关注
- 1318 浏览
添加回答
举报
0/150
提交
取消