链表的插入排序

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


const int N=100;


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






void CreateList(LinkList &L,int n)
{
LinkList p;
srand(time(0));
L=(LinkList)malloc(sizeof(Node));
L->next=NULL;
for(int i=0;i<n;i++)
{
p=(LinkList )malloc(sizeof(Node));
p->data=rand();
p->next=L->next;
L->next=p;
}
}


void ReadList(LinkList L)
{
LinkList p;
int i=0;
p=(LinkList)malloc(sizeof(Node));
p=L->next ;
while(p)
{
cout<<p->data<<"  ";
p=p->next;
i++;
}
cout<<endl<<i<<endl<<endl;
}


void SortList(LinkList &L,LinkList &S,int N)
{
LinkList p,q,s;
p=(LinkList)malloc(sizeof(Node));

s=(LinkList)malloc(sizeof(Node));//每次充当新链表的一个中间变量


p=L->next;
S=(LinkList)malloc(sizeof(Node));
S->next=NULL;


int tmp=0;
for(int i=0 ;i<N;i++)
{
tmp=p->data;
if(S->next==NULL|| tmp<S->next->data)
{
q=(LinkList)malloc(sizeof(Node));
q->data=tmp;
q->next=S->next;
S->next=q;
}



else
{

s=S->next;
while((s->next!=NULL )&&(s->next->data < tmp))//注意这里是需要while，不然用if只执行一次
//if(s->data<tmp&&s->next)
s=s->next;




q=(LinkList)malloc(sizeof(Node));
q->data=tmp;
q->next=s->next;
s->next=q;

}
p=p->next;
}
}


int main(void)
{
clock_t start,stop,elapsed;
LinkList L=NULL,S=NULL;
CreateList(L,N);
ReadList(L);
start=clock();
SortList(L,S,N);
stop=clock();
elapsed=stop-start;
cout<<elapsed<<endl;
ReadList(S);
return 0;
}