选择法实现链表排序

#include <stdio.h>
#include <stdlib.h>
/*
选择法实现链表排序
*/
typedef struct node
{
    int data;
    struct node * next;
}NODE;
NODE * createList()
{
    NODE *head = (NODE *)malloc(sizeof(NODE));
    head->next = NULL;

    return head;
}
void insertNode(NODE *head,int nodeData)
{
    NODE *sur = (NODE *)malloc(sizeof(NODE));
    sur->data = nodeData;

    sur->next = head->next;
    head->next = sur;

    return ;
}
void traverList(NODE *head)
{
    head = head->next;
    while(head)
    {
        printf("%d\n",head->data);
        head = head->next;
    }
}
int lenList(NODE *head)
{
    int len = 0;
    head = head->next;
    while(head)
    {
        len++;
        head = head->next;
    }
    return len;
}
void choiceSort(NODE *head,int len)
{
    int i,j,temp;
    NODE * p,*q,*t;
    p = head->next;
    for(i = 0;i<len-1;i++)
    {
        q = p->next;
        t = p;
        for(j = i+1;j<len;j++)
        {
            if(t->data > q->data)
            {
                t = q; //比而不换，只记地址。
            }
            q = q->next;//第二个元素和头上元素比较完后往前走一走

        }
        if(t != p)
        {
            
            temp = t->data;
            t->data = p->data;
            p->data = temp;
        }
        p = p->next;//一趟完事后，头上的元素往前走一走
    }
    return ;
}
int main(void)
{
    NODE * head = createList();
    for(int i = 0;i<50;i++)
        insertNode(head,rand()%100);
    traverList(head);
    printf("选择法排序后\n");
    int len = lenList(head);
    choiceSort(head,len);
    traverList(head);
    return 0;
}