两链表的连接和排序.cpp

学习VC++的最基础程序

#include<iostream>
using namespace std;
struct p
{
	int number;
	p *next;
};
p *a;
p *b;
p *end;
p *headnode;
p *Create(p *head)
{
	head=headnode;
	headnode->next=NULL;
	end=headnode;
	p *ps;
	ps=new p;
	cin>>ps->number;
	while(ps->number)
	{
		end->next=ps;
		end=ps;
		ps=new p;
		cin>>ps->number;
	}
	end->next=NULL;
	delete ps;
	return(head);
}
void main()
{
	a=Create(a);
	p *Aend=end;
	b=Create(b);
	Aend->next=headnode->next;//连接,即a=a+b;
	int sam=0;
	for(p *pG=headnode->next;pG!=end;pG=pG->next){
		for(p *pGG=pG->next;pGG!=end->next;pGG=pGG->next)
		{
			if(pG->number>pGG->number)
			{
				sam=pG->number;
				pG->number=pGG->number;
				pGG->number=sam;
			}
		}
	}//----------------排序
	for(pG=headnode->next;pG!=end->next;pG=pG->next)
		cout<<"连接排序后的链表"<<pG->number<<endl;
}