两个有序单链表的归并算法.doc

#include#define MAX 20typedef int ElemType;struct LinkList ElemType data;LinkList *next;void Initial(LinkList *&L) /初始化有序单链表 L=new LinkList;L-next=NULL;void LinkInsert(LinkList *&L,ElemType e) /有序单链表的插入运算 LinkList *p=L,*q;while(p-next!=NULL&p-next-datanext;q=new LinkList;q-data=e;q-next=p-next;p-next=q;void DisList(LinkList *&L) /有序单链表的显示 LinkList *p=L;while(p-next!=NULL) coutnext-datanext;void combatLink(LinkList *&LA,LinkList *&LB,LinkList *&LC) /有序单链表的归并运算 LinkList *p=LA,*q=LB,*s,*r=LC;/*while(p-next!=NULL) while(q-next!=NULL) if(p-next-dataq-next-data) s=new LinkList;s-data=q-next-data;s-next=r-next;r-next=s;r=s;s=new LinkList;s-data=p-next-data;s-next=r-next;r-next=s;r=s;else s=new LinkList;s-data=p-next-data;s-next=r-next;r-next=s;r=s;s=new LinkList;s-data=q-next-data;s-next=r-next;r-next=s;r=s;q=q-next;q=LB;p=p-next;*/while(p-next!=NULL) s=new LinkList; s-data=p-next-data;s-next=r-next;r-next=s;r=s;p=p-next;while(q-next!=NULL) s=new LinkList;s-data=q-next-data;s-next=r-next;r-next=s;r=s;q=q-next;r=LC;s=LC-next;ElemType e;while(r-next!=NULL) while(s-next!=NULL) if(r-next-datas-next-data) e=r-next-data;r-next-data=s-next-data;s-next-data=e;s=s-next;s=r-next;r=r-next;void main() LinkList *LA,*LB,*LC;Initial(LC);Initial(LA);Initial(LB);int i;ElemType e;cout请输入十个数存于A表：endl;for(i=0;ie;LinkInsert(LA,e);DisList(LA);coutendlendl请输入是个数存于B表：endl;for(i=0;ie;LinkInsert(LB,