有序单链表的归并算法

la和lb均为非递减单链表，现由la, lb合并出lc（lc非递减），算法如下：

void mergelist(&la, &lb, &lc){
	pa = la -> next;
	pb = lb -> next;
	lc = pc = la;

	while(pa && pb){
		if(pa -> data <= pb -> data){
			pc -> next = pa;
			pc = pa;
			pa = pa -> next;
		}
		else{
			pc -> next = pb;
			pc = pb;
			pb = pb -> next;
		}
	}
	pc -> next = pa ? pa : pb;
	free (lb);
}