单链表的插入排序

79 stu * sort_link_insert(stu *head)
80 {
81 stu *p = NULL;
82 stu *pp = NULL;
83 stu *s = NULL;
84 stu *first = NULL;
85
86 if(head == NULL)
87 {
88 return head;
89 }else if(head->next == NULL){
90 return head;
91
92 }
93
94 first = head->next;
95 head->next = NULL;
96
97 while(first != NULL)
98 {
99 s = first;
100 for(p=head, pp=p; p!=NULL && p->data < s->data; pp=p, p=p->next)
101 ;
102
103
104 first = first->next;
105 if(p==head){
106 s->next = head;
107 head = s;
108
109 }else{
110
111 s->next = p;
112 pp->next = s;
113 }
114
115 }
116
117 return head;
118
119 }