void merge(SeqList A, SeqList B, SeqList* C){
int i, j, k;
i = 0; j = 0; k = 0;
while (i <= A.last&&j <= B.last){
if (A.elem[i] <= B.elem[j])
C->elem[k++] = A.elem[i++];
else
C->elem[k++] = B.elem[j++];
}
while (i <= A.last)
C->elem[k++] = A.elem[i++];
while (j <= B.last)
C->elem[k++] = A.elem[j++];
C->last = k - 1;
}
将链表A和链表B合并在链表C中同时完成排序功能。