数据结构,顺序表的初始化,求顺序表的长度,插入删除,取数据元素,查找,遍历.docVIP

数据结构,顺序表的初始化,求顺序表的长度,插入删除,取数据元素,查找,遍历 #includestdio.h #includestdlib.h #define NULL 0 #define MAXSIZE 1024 /*顺序表可能的最大长度，假设为1024 */ typedef int elemtype; /*elemtype可为任意类型，假设为int型 */ typedef struct sequlist { elemtype data[MAXSIZE]; /*定义顺序表为一维数组*/ int last; /*last为表中最后一个数据元素的下标位置*/ }SequenList; /*顺序表的结构类型为SequenList*/ /*函数声明*/ SequenList * Init_SequenList( ); int SequenList_Length(SequenList*L); int Insert_SequenList(SequenList*L,elemtype x,int i); void menu(); int Delete_SequenList(SequenList*L,int i); elemtype GetData_SequenList(SequenList*L,int i); int Search_SequenList(SequenList*L,elemtype key); void Print_SequenList(SequenList*L); void SequenList_Iuput(SequenList*L); /*主函数*/ void main() { char cmd; int i,Length,isdo; elemtype x ,data,key; SequenList *L=NULL; system(cls); menu(); while((cmd=getchar())!=#) { switch(cmd) { case 1: L=Init_SequenList( ); printf(\nCreating the list!\n); printf(\n\n\n\t\t\t); break; case 2: L=SequenList_Iuput(L); printf(\nInputing data ....\n); printf(\n\n\n\t\t\t); break; case 3: Length=SequenList_Length(L); printf(\nThe Length of the list is %d\n,Length); printf(\n\n\n\t\t\t); break; case 4: printf(input....,i,x); scanf(%d%d,i,x); x=Insert_SequenList( L,x,i); printf(\nInserting the data into the list!\n); printf(\n\n\n\t\t\t); break; case 5: isdo=Delete_SequenList(L,i); printf(\nDeleting the data in the list......\n); printf(\n\n\n\t\t\t); break; case 6: printf(%d,i); scanf(%d,i); x= GetData_SequenList(L,i); if(x!=0) printf(%d%d,i,x); printf(\nGeting the data of the position...\n); printf(\n\n\n\t\t\t); break; case 7: data=Search_SequenList(L,key); printf(\nSearching the data ...\n); printf(\n\n\n\