双端链表 冒泡排序

#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(int size){
    return (char *)malloc((size + 1) * sizeof(char));
}

void scan(DuLinkList &L){
    int n;
    char str[100];
    DuLinkList lp, p;
    scanf("%d", &n);
    scanf("%s", str);
    p = create();
    p->data = create_str(strlen(str));
    strcpy(p->data, str);
    p->prior = NULL;
    p->next = NULL;
    L = p;
    while(--n){
        scanf("%s", str);

37         lp = create();
        lp->data = create_str(strlen(str));
        strcpy(lp->data, str);
        lp->prior = p;
        lp->next = NULL;

        p->next = lp;

        p = lp;
    }
}
void insertion_sort(DuLinkList &L){
    
    DuLinkList sign = NULL, p1, p2;
    for(DuLinkList cnt = L; cnt->next != NULL; cnt = cnt->next){
        for(p1 = L, p2 = L->next; p2 != sign; p1 = p1->next, p2 = p2->next){
            if(strcmp(p1->data, p2->data) >= 0){
                char *tmp = p1->data;
                p1->data = p2->data;
                p2->data = tmp;
            }
        }
        sign = p1;
    }
}

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

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

    return 0;
}

测试数据

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