有序表的存储结构

void ListInsert(SqList *&L, ElemType e){
    int i=0, j;
    while (i<L->length&&L->data[i]<e) {
        i++;
    }
    for (j=ListLength(L); j>i; i--) {
        L->data[j]=L->data[j-1];
    }
    L->data[i]=e;
    L->length++;
}

void ListInsert(LinkList *&L, ElemType e){
    LinkList *pre =L, *p;
    while (pre->next!=NULL&&pre->next->data<e) {
        pre=pre->next;
    }
    p=(LinkList *)malloc(sizeof(LinkList));
    p->data=e;
    p->next=pre->next;
    pre->next=p;
}