链表排序

#include<iostream>
using namespace std;
#include<string.h>
typedef struct{
	char name[100];
	char num[10];
	int score;
	}Student;
typedef struct LNode{
	Student data;
	struct LNode *next;
	}LNode, *LinkList;
int main()
{
	LinkList Head, p, q, t, pt, pre;
	Head = new LNode;
	Head->next = NULL;
	p = Head;
	char names[6][100] = {"李明", "肖章", "王一", "鹿晗", "张依依", "任雪"},
		 nums[6][10] = {"1000","1001", "1002","1003", "1004", "1005"};
	int scores[6] = {98, 87, 99, 100, 100, 84}, i, j;
	for(i=0; i<6; i++)
	{
		q = new LNode;
		strcpy(q->data.name, names[i]);
		strcpy(q->data.num, nums[i]);
		q->data.score = scores[i];
		q->next = NULL;
		p->next = q;
		p = q;
	}
	
	for(pt = Head->next; pt != NULL; pt = pt->next)
		for(pre = Head, p = Head->next; p != NULL; p=p->next, pre = pre->next)
		{
			q = p->next;
			if(p->data.score < q->data.score)
			{
				pre->next = q;
				p->next = q->next;
				q->next = p;	
			}
		}
	p = Head->next;
	while(p)
	{
		//cout<<Head.data.name<<\tHead.data.score<<end;
		cout<< p->data.name<<"\t"<<p->data.score<<endl; 
		p = p->next;		
	}
	return 0;
}