c語(yǔ)言順序表實(shí)現(xiàn)完整版

1、#include #include#include#define LIST_INIT_SIZE 100#define LISTINCREMENT 10typedef int Elemtype;typedef int Status;typedef structElemtype *elem;int length;int listsize;SqList; /定義順序表類型Status InitList_Sq(SqList &L) /初始化順序表L.elem=(Elemtype *)malloc(LIST_INIT_SIZE* sizeof(Elemtype);L.length=0;L.listsiz

2、e=LIST_INIT_SIZE;return 1;void CreateList(SqList &L) /創(chuàng)建順序表int i;printf(請(qǐng)輸入你要?jiǎng)?chuàng)建的順序表元素個(gè)數(shù) );scanf(%d,&L.length);printf(請(qǐng)輸入你要?jiǎng)?chuàng)建的順序表:n);for(i=0;iL.length;i+)scanf(%d,&L.elemi);void print( SqList &L)/輸出順序表int i;for(i=0;iL.length;i+)printf(%3d,L.elemi);Status location( SqList L,Elemtype e)/查找元素的位置int i=0;

3、while(L.elemi!=e & iL.length)return -1;elsereturn i+1;/因?yàn)閏語(yǔ)言是從下標(biāo)0開(kāi)始的當(dāng)i=0時(shí)實(shí)際上是順序表的第i+1個(gè)元素Status ListInsert_Sq(SqList &L,int i,Elemtype e)/在順序表的第i個(gè)位置插入值為e的元素Elemtype *newbase,*q,*p;if(iL.length+1)return 0;if(L.length=L.listsize)newbase=(Elemtype *)realloc(L.elem,(L.listsize+LISTINCREMENT)* sizeof(Elem

4、type);L.elem=newbase;L.listsize+=LISTINCREMENT;q=&(L.elemi-1);for(p=&(L.elemL.length-1);p=q;-p)*(p+1)=*p;*q=e;+L.length;return 1;Status ListDelect_Sq(SqList &L,int i,Elemtype e)/在順序表的第i個(gè)位置刪除值為e的元素并返回e的值Elemtype *q,*p;if(iL.length)return 0;p=&(L.elemi-1);e=*p;q=L.elem+L.length-1;for(+p;p=q;+p)*(p-1)=

5、*p;-L.length;return 1;void Combine(SqList La,SqList Lb,SqList &Lc)/將兩個(gè)非遞減的順序表合并成一個(gè)順序表，合并后元素也按值非遞減排列 Elemtype *pa_last,*pb_last,*pa,*pb,*pc; pa=La.elem; pb=Lb.elem; Lc.listsize=Lc.length=La.length+Lb.length; pc= Lc.elem=(Elemtype *)malloc(Lc.listsize* sizeof(Elemtype); pa_last=La.elem+La.length-1;pb_

6、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+;void main()SqList la,lb,lc,ld;int i,j;Elemtype e; InitList_Sq(la);CreateList(la);print(la);printf(請(qǐng)輸入要查找的元素:n);scanf(%d,&e);j=location(la,e);printf(該元素的位置為%dn,j);printf(請(qǐng)輸入要插入的位置和元素:n);scanf(%d%d,&i,&e);ListInsert_Sq(la,i,e);printf(輸出插入后的順序表:n);print(la);printf(請(qǐng)輸入要?jiǎng)h除的位置:n);scanf(%d,&i);ListDelect_Sq(la,i,e);printf(刪除的那個(gè)元素是:%dn,e);printf(輸出刪除后的順序表:n);print(la);InitList_Sq(lb);CreateList(lb);print(l