数据结构代码.doc

《数据结构代码.doc》由会员上传分享，免费在线阅读，更多相关内容在教育资源-天天文库。

1、........数据结构代码P20，例2-1voidunion(List&La,ListLb){La_len=ListLength(La);Lb_len=ListLength(Lb);for(i=1;i<=Lb_len;i++){GetElem(Lb,i,e);if(!LocateElem(La,e,equal))ListInsert(La,++La_len,e);}}P21,例2-2,将voidMergeList(ListLa,ListLb,List&Lc){InitList(Lc);i=j=1;k=0;La_len=ListLength(La);Lb_le

2、n=ListLength(Lb);while((i<=La_Len)&&(j<=Lb_len)){GetElem(La,i,ai);GetElem(Lb,j,bj);if(ai<=bj){ListInsert(Lc,++k,ai);++i;}else{ListInsert(Lc,++k,bj);++j}}while(i<=La_len){GetElem(La,i++,ai);ListInsert(Lc,++k,ai);}while(j<=Lb_len){GetElem(Lb,i++,bj);ListInsert(Lc,++k,bj);}}P22,线性表的顺序存

3、储结构#defineLIST_INIT_SIZE100#defineLISTINCREMENT10typedefstruct.s...............{ElemType*elem;/*线性表占用的数组空间*/intlength；intlistsize;}SqList；P23,线性表顺序存储结构上的基本运算初始化操作StatusIniList_Sq(SqList&L){L.elem=(ElemType*)malloc(LIST_INIT_SIZE*sizeof(ElemType));if(!L.elem)exit(OVERFLOW);L.len

4、gth=0;L.listsize=LIST_INIT_SIZE;returnOK;}P24,在顺序表里插入一个元素StatusListInsert_sq(SqList&L,inti,ElemTypee){if(i<1

5、

6、i>=L.length+1)returnERROR;if(L.length>=L.listsize){newbase=(ElemType*)realloc(L.elem,(L.listsize+LISTINCREMENT)*sizeof(ElemType));if(!newbase)exit(OVERFLOW);L.elem=newbase;L

7、.listsize+=LISTINCREMENT;}q=&(L.elem[i-1]);for(p=&(L.elem[L.length-1]));p>=q;--p)*(p+1)=*p;*q=e;++L.length;returnOK；}P24,在顺序表里删除一个元素StatusListDelete_Sq(SqList&L,inti,ElemType&e){if((i<1)

8、

9、(i>L.length))returnERROR;p=&(L.elem[i-1]);e=*p;q=L.elem+L.length-1;for(++p;p<=q;++p)*(p-1)=*p;-

10、-L.length;returnOK;}P25,在顺序表里查找一个元素intLocatElem_Sq(SqListL,ElemTypee,.s...............Status(*compare)(ElemType,ElemType)){i=1;p=L.elem;while(i<=L.length&&!(*compare)(*p++,e))++i;if(i<=L.length)returni;elsereturn0;}P26,顺序表的合并voidMergeList_Sq(SqListLa,SqListLb,SqList&Lc){pa=La.elem;p

11、b=Lb.elem;Lc.listsize=Lc.length=La.length+Lb.length;pc=Lc.elem=(ElemType*)malloc(Lc.listsize*sizeof(ElemTpe));if(!Lc.elem)exit(OVERFLOW);pa_last=La.elem+La.length-1;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

12、)*pc++=*pa++;while(