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

《两个有序单链表的归并算法》由会员上传分享，免费在线阅读，更多相关内容在行业资料-天天文库。

1、#include#defineMAX20typedefintElemType;structLinkList{ElemTypedata;LinkList*next;};voidInitial(LinkList*&L)//初始化有序单链表{L=newLinkList;L->next=NULL;}voidLinkInsert(LinkList*&L,ElemTypee)//有序单链表的插入运算{LinkList*p=L,*q;while(p->next!=NULL&&p->next->datanext;q=new

2、LinkList;q->data=e;q->next=p->next;p->next=q;}voidDisList(LinkList*&L)//有序单链表的显示{LinkList*p=L;while(p->next!=NULL){cout<next->data<<"t";p=p->next;}}voidcombatLink(LinkList*&LA,LinkList*&LB,LinkList*&LC)//有序单链表的归并运算{LinkList*p=LA,*q=LB,*s,*r=LC;/*while(p->next!=NULL){whil

3、e(q->next!=NULL){if(p->next->data>q->next->data){s=newLinkList;s->data=q->next->data;s->next=r->next;r->next=s;r=s;s=newLinkList;s->data=p->next->data;s->next=r->next;r->next=s;r=s;}else{s=newLinkList;s->data=p->next->data;s->next=r->next;r->next=s;r=s;s=newLinkList;s->data=q

4、->next->data;s->next=r->next;r->next=s;r=s;}q=q->next;}q=LB;p=p->next;}*/while(p->next!=NULL){s=newLinkList;s->data=p->next->data;s->next=r->next;r->next=s;r=s;p=p->next;}while(q->next!=NULL){s=newLinkList;s->data=q->next->data;s->next=r->next;r->next=s;r=s;q=q->next;}r=LC;s=

5、LC->next;ElemTypee;while(r->next!=NULL){while(s->next!=NULL){if(r->next->data>s->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;}}voidmain(){LinkList*LA,*LB,*LC;Initial(LC);Initial(LA);Initial(LB);inti;ElemTypee;cout<<"

6、请输入十个数存于A表："<>e;LinkInsert(LA,e);}DisList(LA);cout<>e;LinkInsert(LB,e);}DisList(LB);cout<