链表值排序之冒泡

#include <stdio.h>
#include <stdlib.h>
/*
链表值排序之冒泡：核心思想：1.每次都从头开始比较
                            2.推动链表往下走的不在是下标
*/
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 insertData)
{
    NODE * sur = (NODE *)malloc(sizeof(NODE));
    sur->data = insertData;

    sur->next = head->next;
    head->next = sur;
    return ;
}
void traverNode(NODE * head)
{
    head = head->next;
    while(head)
    {
        printf("%d\n",head->data);
        head = head->next;
    }
    return ;
}
int lenList(NODE *head)
{
    int len = 0;
    head = head->next;
    while(head)
    {
        len++;
        head = head->next;
    }

    return len;
}
void sortNode(NODE *head)
{
    int len = lenList(head);
    NODE * sur = NULL;
    int temp;
    for(int i = 0;i<len-1;i++)
    {
        sur = head->next;
        for(int j = 0;j<len-1-i;j++)
        {
            if(sur->data > sur->next->data)
            {
                temp = sur->data;
                sur->data = sur->next->data;
                sur->next->data = temp;
            }
            sur = sur->next;//推动链表向前走
        }
    }
    return ;
}
int main(void)
{
    NODE * head = createList();
    for(int i = 0;i<30;i++)
    {
        insertNode(head,rand()%100);
    }
    printf("排序前\n");
    traverNode(head);
    printf("排序后\n");
    sortNode(head);
    traverNode(head);

    return 0;
}