单链表的正向排序，反向排序

这里实现正向排序之后利用一下单链表的逆置Reverse （）便得到反向排序结果

#include <iostream>
using namespace std;
#include <stdio.h>


struct Node 
{
int data;
Node *next;
};


Node *InsertSort_List(void)
{
int data=0;
Node *head=NULL;
Node *NewNode,*CurNode,*PreNode;


while(1)
{
cout<<"please input the data: ";
cin>>data;
if(data==0)
break;


NewNode=(Node *)malloc(sizeof(Node));
NewNode->data=data;
NewNode->next=NULL;


if(head==NULL)
{
head=NewNode;
continue;
}


if(NewNode->data <= head->data )
{
NewNode->next=head;
head=NewNode;//为头结点赋值
continue;
}


CurNode=head;
PreNode=head;
while(NewNode->data > CurNode->data && CurNode->next!=NULL)
{
PreNode=CurNode;
CurNode=CurNode->next;
}


if(NewNode->data <= CurNode->data)
{
PreNode->next=NewNode;
NewNode->next=CurNode;
}
else
CurNode->next=NewNode;
}
return head;
}


void print(Node *head)
{
Node *p;
int i=1;
p=head;
while(p!=NULL)
{

cout<<"The "<<i<<"th data is: "<<p->data<<endl;
p=p->next;
i++;
}
cout<<endl;
}


Node *reverse(Node *head)//单链表的逆置，，，这里为反向排序
{
Node *p,*q,*r;
p=head;
if(head==NULL)
return NULL;
if(head->next==NULL)
return head;


q=p->next;
p->next=NULL;


while(q!=NULL)
{
r=q->next;
q->next=p;
p=q;
q=r;
}
head=p;
return head;
}


int main()
{
Node *head,*Rever;


head=InsertSort_List();
print(head);
Rever=reverse(head);
print(Rever);


return 0;
}

运行结果如下：