线性表的动态顺序存储实现（Implementation of dynamic sequential storage of linear table）.doc

下载文档 降价啦

0
0
约5.81千字
约 18页
2017-08-15 发布于河南
举报
版权申诉
保障服务

线性表的动态顺序存储实现（Implementation of dynamic sequential storage of linear table）.doc

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

线性表的动态顺序存储实现（Implementation of dynamic sequential storage of linear table）

线性表的动态顺序存储实现（Implementation of dynamic sequential storage of linear table） / *DynaSeqList.cpp - dynamic sequential table, that is, the dynamic array implementation of the sequential table * * Topic: experiment 2-1 linear table dynamic order storage implementation * * class: * * name: * * student number: * ****/ #include stdlib.h #include malloc.h #include memory.h #include assert.h #include DynaSeqList.h Const int LIST_INIT_SIZE = 100; / / the maximum length of the initial allocation table Const int LISTINCREMENT = 10; / / incremental memory allocation /*------------------------------------------------------------ Operation purpose: initialize the order table Initial condition: None Operation results: construct an empty linear table Function parameter: SqList *L initializes the linear list to be initialized Return value: Is the bool operation successful? ------------------------------------------------------------*/ Bool InitList (SqList *L) { Assert (L = = NULL); L-elem = (ElemType*) malloc (sizeof (ElemType) * LIST_INIT_SIZE); If (L-elem = = NULL) return false; L-length = 0; L-listsize = LIST_INIT_SIZE; Return true; } /*------------------------------------------------------------ Operation objective: destroy the order table Initial condition: the linear table L already exists Operation results: destroy linear table L Function parameter: SqList *L linear list to be destroyed Return value: nothing ------------------------------------------------------------*/ Void DestroyList (SqList *L) { Assert (L = = NULL); Free (L-elem); L-elem = NULL; } /*------------------------------------------------------------ The purpose of the operation is to determine whether the sequence table is empty Initial condition: the linear table L already exists Operation results: if L is an empty table, returns true, otherwise returns false Function parameter: SqList L linear table to be judged Return value: Is bool empty? ------------------------------------------------------------*/ Bool Li