学习笔记——数据结构（WEEK 4-2）

顺序表与链表比较

链式储存结构优缺点

存储密度

比较

线性表的应用

线性表，有序表的合并

线性表

void union_L(List& La, List& Lb) {
    int La_len = GetLength(La);
    int Lb_len = GetLength(Lb);
    for (int i = 1; i <= Lb_len; i++) {
        ElemType e;
        GetElem(Lb, i, &e);
        if (!LocateElem(&La, e)) Insert(&La, ++La_len, e);
    }
}

有序表

顺序表

void Merge_L(SqList La, SqList Lb, SqList& Lc) {
    ElemType *pa = La.elem;
    ElemType *pb = Lb.elem;
    Lc.length = La.length + Lb.length;
    Lc.elem = new ElemType[Lc.length];
    ElemType* pc = Lc.elem;
    ElemType* pa_last = La.elem + La.length - 1;
    ElemType* pb_last = Lb.elem + Lb.length - 1;
    while (pa <= pa_last && pb <= pb_last) {
        if (*pa <= *pb) *pc++ = *pa++;
        else *pc++ = *pb++;

    }
    while(pa <= pa_last) *pc++ = *pa++;
    while (pb <= pb_last) *pc++ = *pb++;
}

链表

案例分析与实现