数据结构 -排序

排序

#include <stdio.h>
#include <stdlib.h>
typedef struct Node
{
	int data;
	struct Node* next;
}Node,*LinkList;
void init_list(LinkList* head)
{
	*head = (LinkList)malloc(sizeof(Node));
	(*head)->next = NULL;
}
void CreatList(LinkList* head)//头插法 
{
    int x;
    int flag = 1;
    while(flag ==1)
    {
        scanf("%d",&x);
        if(x != 0)
        {
            Node* p =(Node*)malloc(sizeof(Node));
    	    p->data = x;
    	    p->next = (*head)->next;    
    	    (*head)->next = p;
	        flag = 1;
	    }else flag = 0;
    }
}
void insertsort(LinkList head)//插入排序 
{
	Node* pre,*q,*p,*s;
    if(head->next != NULL)
	{
	    pre = head;
		q = head->next;
		if(q->next != NULL)
		{
		    p = q->next;
			while(p != NULL)
			{
				while(p->data >= q->data)
				{
			        p = p->next;
				    q = q->next;
			    }
				if(p != NULL && p->data < q->data)
				{
				    s = p;
					q->next = p->next;
					p = p->next;
					while(s->data > pre->next->data)
					    pre = pre->next;	
					s->next = pre->next;
					pre->next = s;
					pre = head;
				}	
			}	
		}	
	} 
}
void print(LinkList head)//输出 
{
	Node* p = head;
	while(p->next != NULL)
	{
		printf("%d ",p->next->data);
		p = p->next;
	}
}
int main() {
	LinkList mylist;
	init_list(&mylist);
	CreatList(&mylist);
	insertsort(mylist);
	print(mylist);
	return 0;
}