双端链表 冒泡排序 有头结点 交换两个节点位置

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

typedef char * ElemType;

typedef struct DuLNode {
    ElemType data;
    struct DuLNode *prior, *next;
} DuLNode, *DuLinkList;


DuLinkList create(){
    return (DuLinkList)malloc(sizeof(DuLNode));
}

char * create_str(char *str){
    char *ss = (char *)malloc((strlen(str) + 1) * sizeof(char));
    strcpy(ss, str);
    return ss;
}

void scan(DuLinkList L){
    int n;
    char str[1024];
    DuLinkList lp, p = L;
    scanf("%d", &n);
    while(n--){
        scanf("%s", str);

        lp = create();
        lp->data = create_str(str);
        lp->prior = p;
        lp->next = NULL;

        p->next = lp;

        p = lp;
    }
}
void insertion_sort(DuLinkList L){
    int cnt = 0;
    for(DuLinkList pcnt = L->next; pcnt != NULL; pcnt = pcnt->next){
        cnt++;
    }

    DuLinkList sign = NULL, p1, p2;
    while(--cnt){
        for(p1 = L->next, p2 = L->next->next; p2 != sign; p1 = p1->next, p2 = p2->next){
            if(strcmp(p1->data, p2->data) >= 0){
                //交换两个节点
                p1->prior->next = p2;
                if(p2->next != NULL){
                    p2->next->prior = p1;
                }
                p1->next = p2->next;
                p2->prior = p1->prior;

                p1->prior = p2;
                p2->next = p1;

                DuLinkList tmp = p1;
                p1 = p2;
                p2 = tmp;
            }
        }
        sign = p1;
    }
}

void print(DuLinkList L){
    DuLinkList p = L->next;
    while(p != NULL){
        printf("%s ", p->data);
        p = p->next;
    }
    puts("");
}

int main(){
    //freopen("data.txt", "r", stdin);
    DuLNode L;
    //输入数据
    scan(&L);
    //打印输出
    print(&L);
    //冒泡排序
    insertion_sort(&L);
    //打印数据
    print(&L);

    return 0;
}

测试代码

10
9只小昆虫
8只小昆虫
7只小昆虫
6只小昆虫
5只小昆虫
4只小昆虫
3只小昆虫
2只小昆虫
1只小昆虫
0只小昆虫