c语言实现顺序表的基本操作（C language to achieve the basic operation of the order table）.doc

下载文档 降价啦

5
0
约9.95千字
约 21页
2017-08-31 发布于河南
举报
版权申诉
保障服务

c语言实现顺序表的基本操作（C language to achieve the basic operation of the order table）.doc

1、本文档共21页，可阅读全部内容。
2、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。
3、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。

c语言实现顺序表的基本操作（C language to achieve the basic operation of the order table）

c语言实现顺序表的基本操作（C language to achieve the basic operation of the order table） C language to achieve the basic operation of the order table 2009-09-19 11:42:39| classification: C language data node name | subscription Header file Sqlist1.h #includemalloc.h #includestdio.h #includestdlib.h #define TRUE 1 #define FALSE 0 #define OK 1 #define ERROR 0 #define OVERFLOW 0 #define, LIST_INIT_SIZE, 10//, initial allocation of linear table storage space #define LISTINCREMENT 2// linear table storage space allocation increment Typedef int Status; Typedef int ElemType; Typedef struct Sqlist {ElemType *elem; / / storage space base Int length; / / current length Int listsize; / / the current storage capacity allocation }Sqlist; / / common function Void InitList (Sqlist L); / / initialize a linear table Status ListInsert (Sqlist L, int i, ElemType E); / / insert elements to the linear table Void ListTraverse (Sqlist L, void (*visit) (ElemType L)); / / traversal of elements, and output Void print1 (ElemType e); / / output elements Status ListEmpty (Sqlist L); / / to determine whether the table is empty table Void ClearList (Sqlist L); / / will be reset to the empty table table Int ListLength (Sqlist L); / / returns the number of elements in the L Status GetElem (Sqlist L, int i, ElemType e); / / return by e L in the I element value Int LocateElem (Sqlist L, ElemType e, Status (* compare) (ElemType, ElemType)); / / return L in first and E (compare) satisfy the rank data, if the data does not exist just to return a value of 0 Status equal (ElemType C1, ElemType C2); / / determine whether the function of equal Status PriorElem (Sqlist L, ElemType cur_e, ElemType pre_e); / / if cur_e is a data element of L, but not the first, we use pre_e to return it to the precursor of S Status NextElem (Sqlist L, ElemType cur_e, ElemType next_e); / / if cur_e is a data element of L, but not the last one, then return it with next_es successor Status ListDelete (Sqlist L, int i, ElemType e); / / delete