链表指针交换实现冒泡排序

#include <stdio.h>
#include <stdlib.h>
/*
链表指针交换实现冒泡排序：核心思想：1.每次都从头开始比较
                                    2.sh,p,q整体往前走一步（交不交换都要往前走）
                                    3.交换完之后p变成q,q变成p,整体往前走，下次交换就会出现混乱，所以p，q还要指向原来的位置才能整体往前走
*/
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;
}
void traverList(NODE * head)
{
    head = head->next;
    while(head)
    {
        printf("%d
",head->data);
        head = head->next;
    }
}
int lenList(NODE *head)
{
    int len = 0;
    head = head->next;
    while(head)
    {
        len++;
        head = head->next;
    }

    return len;
}
void pointerPopsort(NODE *head,int len)
{
    NODE * sh,*p,*q,*temp;
    sh = p = q = NULL;
    for(int i = 0;i<len-1;i++)
    {
        //每次都从头开始比较
        sh = head;
        p = sh->next;
        q = p->next;
        for(int j = 0;j<len-1-i;j++)
        {
            if(p->data > q->data)
            {
                //交换指针
                sh->next = q;
                p->next = q->next;
                q->next = p;
                
                //交换完之后p变成q,q变成p,整体往前走，下次交换就会出现混乱，所以p，q还要指向原来的位置才能整体往前走
                temp = p;
                p = q;
                q = temp;
            }
            //sh,p,q整体往前走一步（交不交换都要往前走）、
            sh = sh->next;
            p = p->next;
            q = q->next;

        }
    }
}
int main(void)
{
    NODE * head = createList();
    for(int i = 0;i<50;i++)
        insertNode(head,rand()%100);
    traverList(head);
    int len = lenList(head);
    printf("排序后
");
    pointerPopsort(head,len);
    traverList(head);

    return 0;
}