顺序表的相关算法(可运行).docVIP

#includestdio.h #includemalloc.h typedef int DataType; #define MaxSize 100 #define True 1 #define False 0 typedef struct { DataType data[MaxSize]; int length; }SeqList; SeqList* IniList() { SeqList *L; L=(SeqList*)malloc(sizeof(SeqList)); int i; L-length=0; for(i=1;i=5;i++){ printf(请输入第%d个元素:\n,i); scanf(%d,L-data[i-1]); L-length++;} return L; } DataType GetNode(SeqList *L,int i) { if((i1)||(iL-length)) return -1; //i的值非法，返回空类型 else return L-data[i-1]; //返回第i个结点（下标是i-1）的值 } int LengthList (SeqList *L) { return L-length; } int LocateList(SeqList *L,