C语言-创建链表及排序

 #include <stdio.h>
 #define NEWNODE (Node *)malloc(sizeof(Node)) 

 typedef struct mynode{
     int num;
     struct mynode *next;
 }Node;

 Node* creat(){
     Node *head=NULL,*p,*q;
     //head:表头，q:表尾
     q=p=NEWNODE;
     scanf("%d",&p->num);
     p->next=NULL;
     while(p->num>){
         if(head==NULL){
             head=q=p;
         }else{
             q->next=p;
             q=p;
         }
         p=NEWNODE;
         scanf("%d",&p->num);
         p->next=NULL;
     }
     return head;
 }

 void print(Node *head){
     Node *p;
     p=head;
     while(p)
     {
         printf("%d ",p->num);
         p=p->next;
     }
     printf("\n");
 }

 int len(Node *head){
     int k=;
     Node *p;
     p=head;
     while(p)
     {
         k++;
         p=p->next;
     }
     return k;
 }

 //选择排序-交换结点
 Node *select_sort(Node *head){
     Node *begin=NULL,*end=NULL;    //有序链表的首尾结点指针
     Node *p;
     Node *min,*premin;    //最小结点及其前一个结点
     if(!head)return NULL;
     while(head){
         //循环找出无序链表中的最小结点min及其前一个结点premin
         p=head;
         min=p;
         while(p->next){
             if(min->num>p->next->num){
                 premin=p;
                 min=p->next;
             }
             p=p->next;
         }
         //1. 将min接入有序链表
         //如果有序链表为NULL
         if(begin==NULL){
             begin=end=min;
         }else{
             end->next=min;
             end=min;
         }
         //2. 在无序链表中删除结点min
         if(min==head){
             head=min->next;
         }else{
             premin->next=min->next;
         }
     }
     end->next=NULL;
     return begin;
 }

 //冒泡排序-交换值
 void pubble_sort(Node *head)
 {
     Node *end;
     int t;
     Node *p,*pre;
     p=head;
     //end~NULL为有序部分，将end置为尾结点
     while(p->next)p=p->next;
     end=p;
     //每轮冒泡end左移一个结点，一直到head与end重合
     while(head!=end){
         p=head;
         while(p!=end){
             if(p->num>p->next->num){
                 t=p->num;
                 p->num=p->next->num;
                 p->next->num=t;
             }
             pre=p;
             p=p->next;
         }
         end=pre;
     }
 }

 int main()
 {
     Node *head;
     head=creat();

     pubble_sort(head);

     print(head);

     return ;
 }