由于链表高效的插入效率,所以插入排序更适合做链表的排序
#include<iostream>
#include<stdio.h>
using namespace std;
typedef struct LNODE
{
int data;
struct LNODE* next;
}LINK;
void insert_link_sort(LINK* head,LINK* node);
void insert(LINK* p,int data)
{
if(p!=NULL)
while(p->next)
p=p->next;
LINK* q=(LINK*)malloc(sizeof(LINK));
q->data=data;
q->next=NULL;
p->next=q;
}
void output_linklist(LINK* p)
{
while(p)
{
cout<<p->data<<" ";
p=p->next;
}
cout<<endl;
}
void link_sort(LINK* head) //升序
{
LINK* pre;
LINK* cur;
if(head==NULL||head->next==NULL)
return;
cur=head->next;
head->next=NULL;
while(cur)
{
pre=cur;
cur=cur->next;
pre->next=NULL;
insert_link_sort(head,pre);
}
}
void insert_link_sort(LINK* head,LINK* node)
{
LINK* p=head->next;
LINK* pre=NULL;
if(!p) //头结点为空的情况
{
head->next=node;
}
else
{
pre=head;
while(p&&p->data<node->data)
{ pre=p;
p=p->next;
}
node->next=pre->next;
pre->next=node;
}
}
int main()
{
int i,j,k;
LINK list;
list.next=NULL;
insert(&list,7);
insert(&list,5);
insert(&list,2);
insert(&list,456);
insert(&list,77);
link_sort(&list);
output_linklist(list.next);
}