链表中插入并排序.cpp

来自「学习VC++的最基础程序」· C++ 代码 · 共 43 行

#include<iostream>
using namespace std;
struct student
{
	int number;
	student *next;
};
student *head;
student *headnode;
student *Create()
{
	student *pEnd;
	head=headnode;
	pEnd=headnode;
	headnode->next=NULL;
	//-------------
	student *ps;
	ps=new student;
	cin>>ps->number;
	while(ps->number)
	{
		pEnd->next=ps;
		pEnd=ps;
		student *ps;
		ps=new student;
		cin>>ps->number;
	}
	pEnd->next=NULL;
	delete ps;
	return(head);
}
void main()
{
	head=Create();
	student *p;
	p=new student;
	cin>>p->number;
	for(student *pG=headnode;pG->next->number<p->number;pG=pG->next)
	{
		p->next=pG->next;
		pG->next=p;
	}
}