实验2动态顺序表的实现.zip

a2586699ZIP实验2动态顺序表的实现.zip  14.5KB

资源文件列表:

ZIP 实验2动态顺序表的实现.zip 大约有6个文件
  1. 实验2动态顺序表的实现/
  2. 实验2动态顺序表的实现/动态顺序表源文件0（菜单）.cpp 1.3KB
  3. 实验2动态顺序表的实现/动态顺序表源文件123(初始化，创建，显示).cpp 2.16KB
  4. 实验2动态顺序表的实现/动态顺序表源文件45(插入，删除).cpp 3.27KB
  5. 实验2动态顺序表的实现/动态顺序表源文件6（查找）.cpp 4.41KB
  6. 实验2动态顺序表的实现/实验2动态顺序表的实现.doc 35KB

资源介绍:

实验2动态顺序表的实现.zip
<link href="/image.php?url=https://csdnimg.cn/release/download_crawler_static/css/base.min.css" rel="stylesheet"/><link href="/image.php?url=https://csdnimg.cn/release/download_crawler_static/css/fancy.min.css" rel="stylesheet"/><link href="/image.php?url=https://csdnimg.cn/release/download_crawler_static/89893915/raw.css" rel="stylesheet"/><div id="sidebar" style="display: none"><div id="outline"></div></div><div class="pf w0 h0" data-page-no="1" id="pf1"><div class="pc pc1 w0 h0"><img alt="" class="bi x0 y0 w1 h1" src="/image.php?url=https://csdnimg.cn/release/download_crawler_static/89893915/bg1.jpg"/><div class="t m0 x1 h2 y1 ff1 fs0 fc0 sc0 ls0 ws0">实验<span class="_ _0"> </span><span class="ff2 sc1">2<span class="ff3">：</span></span>动态顺序表的<span class="_ _1"></span>实现</div><div class="t m0 x2 h3 y2 ff4 fs1 fc0 sc1 ls0 ws0">•<span class="_ _2"> </span><span class="ff1 sc0">要求：</span></div><div class="t m0 x2 h3 y3 ff5 fs1 fc0 sc1 ls0 ws0">1.<span class="_ _3"> </span><span class="ff1 sc0">熟练掌握使用<span class="_ _1"></span>菜单编写程序</span></div><div class="t m0 x2 h3 y4 ff5 fs1 fc0 sc1 ls0 ws0">2.<span class="_ _3"> </span><span class="ff1 sc0">熟练掌握动态<span class="_ _1"></span>顺序表的存储结<span class="_ _1"></span>构</span></div><div class="t m0 x2 h3 y5 ff5 fs1 fc0 sc1 ls0 ws0">3.<span class="_ _3"> </span><span class="ff1 sc0">复习<span class="_ _4"> </span></span>typedef<span class="ff1 sc0">、动态存储分<span class="_ _1"></span>配等<span class="_ _4"> </span></span>C<span class="_"> </span><span class="ff1 sc0">语法</span></div><div class="t m0 x2 h3 y6 ff5 fs1 fc0 sc1 ls0 ws0">4.<span class="_ _3"> </span><span class="ff1 sc0">掌握动态顺序<span class="_ _1"></span>表的基本操作</span></div><div class="t m0 x2 h3 y7 ff5 fs1 fc0 sc1 ls0 ws0">5.<span class="_ _3"> </span><span class="ff1 sc0">理解各个算法<span class="_ _1"></span>的时间复杂度</span></div><div class="t m0 x2 h3 y8 ff4 fs1 fc0 sc1 ls0 ws0">•<span class="_ _2"> </span><span class="ff1 sc0">动态顺序表功<span class="_ _1"></span>能</span></div><div class="t m0 x2 h3 y9 ff5 fs1 fc0 sc1 ls0 ws0">1. <span class="_"> </span><span class="ff1 sc0">初始化一个动态<span class="_ _1"></span>顺序表（空表<span class="_ _1"></span>）</span></div><div class="t m0 x2 h3 ya ff5 fs1 fc0 sc1 ls0 ws0">2. <span class="_"> </span><span class="ff1 sc0">输入<span class="_ _4"> </span></span>n<span class="_"> </span><span class="ff1 sc0">个元素（创建<span class="_ _1"></span>有<span class="_ _4"> </span></span>n<span class="_"> </span><span class="ff1 sc0">个元素的线性表）</span></div><div class="t m0 x2 h3 yb ff5 fs1 fc0 sc1 ls0 ws0">3. <span class="_"> </span><span class="ff1 sc0">输出顺序表</span></div><div class="t m0 x2 h3 yc ff5 fs1 fc0 sc1 ls0 ws0">4. <span class="_"> </span><span class="ff1 sc0">插入给定值<span class="_ _4"> </span></span>e<span class="_"> </span><span class="ff1 sc0">到指定<span class="_ _1"></span>位序<span class="_ _4"> </span></span>i</div><div class="t m0 x2 h3 yd ff5 fs1 fc0 sc1 ls0 ws0">5. <span class="_"> </span><span class="ff1 sc0">删除指定位序<span class="_ _4"> </span></span>i<span class="_"> </span><span class="ff1 sc0">的元<span class="_ _1"></span>素，并保存到<span class="_ _4"> </span></span>e</div><div class="t m0 x2 h3 ye ff5 fs1 fc0 sc1 ls0 ws0">6. <span class="_"> </span><span class="ff1 sc0">查找等于（或大<span class="_ _1"></span>于，或小于）<span class="_ _1"></span>给定值的第一个<span class="_ _1"></span>元素的位序</span></div><div class="t m0 x2 h3 yf ff5 fs1 fc0 sc1 ls0 ws0">0. <span class="_"> </span><span class="ff1 sc0">结束</span></div><div class="t m0 x2 h3 y10 ff4 fs1 fc0 sc1 ls0 ws0">•<span class="_ _2"> </span><span class="ff1 sc0">预编译命令与<span class="_ _1"></span>数据结构</span></div><div class="t m0 x1 h4 y11 ff2 fs1 fc0 sc1 ls0 ws0">#include&lt;stdio.h&gt;</div><div class="t m0 x1 h4 y12 ff2 fs1 fc0 sc1 ls0 ws0">#include&lt;stdlib.h&gt;</div><div class="t m0 x1 h4 y13 ff2 fs1 fc0 sc1 ls0 ws0">#define OK 1</div><div class="t m0 x1 h4 y14 ff2 fs1 fc0 sc1 ls0 ws0">#define ERROR 0</div><div class="t m0 x1 h3 y15 ff2 fs1 fc0 sc1 ls0 ws0">#define OVERFLOW -2<span class="_ _5"> </span><span class="ff5">//<span class="ff1 sc0">请注意，以上<span class="_ _4"> </span></span>5<span class="_"> </span><span class="ff1 sc0">行预编<span class="_ _1"></span>译命令在所有<span class="_ _1"></span>实验都加</span></span></div><div class="t m0 x1 h3 y16 ff2 fs1 fc0 sc1 ls0 ws0">#define LIST_INIT_SIZE <span class="fc1">10</span> <span class="_ _6"> </span>//<span class="ff3">表存储空间的初始分配量</span></div><div class="t m0 x1 h3 y17 ff2 fs1 fc0 sc1 ls0 ws0">#define LISTINCREMENT <span class="fc1">2</span> <span class="_ _7"> </span>//<span class="ff3">线性表存储空间的分配增量</span></div><div class="t m0 x1 h3 y18 ff2 fs1 fc0 sc1 ls0 ws0">typedef int Status;<span class="_ _8"> </span>//<span class="ff1 sc0">返回值为符号常<span class="_ _1"></span>量</span><span class="ff5"> <span class="_"> </span>OK ERROR<span class="_"> </span><span class="ff1 sc0">等时函数类<span class="_ _1"></span>型</span></span></div><div class="t m0 x1 h4 y19 ff2 fs1 fc0 sc1 ls0 ws0">typedef int ElemType;</div><div class="t m0 x1 h4 y1a ff2 fs1 fc0 sc1 ls0 ws0">typedef struct </div><div class="t m0 x1 h4 y1b ff2 fs1 fc0 sc1 ls0 ws0">{</div><div class="t m0 x3 h3 y1c ff2 fs1 fc0 sc1 ls0 ws0">ElemType *elem; <span class="_ _9"> </span>// <span class="_"> </span><span class="ff3">存储空间基址</span></div><div class="t m0 x3 h3 y1d ff2 fs1 fc0 sc1 ls0 ws0">int length; <span class="_ _a"> </span>// <span class="_"> </span><span class="ff3">当前长度</span></div><div class="t m0 x3 h3 y1e ff2 fs1 fc0 sc1 ls0 ws0">int listsize; <span class="_ _b"> </span>// <span class="_"> </span><span class="ff3">当前分配的存储容量</span>(<span class="ff3">以<span class="_ _4"> </span></span>sizeof(ElemType)<span class="ff3">为单位</span>)</div><div class="t m0 x1 h4 y1f ff2 fs1 fc0 sc1 ls0 ws0">} SqList;</div><div class="t m0 x2 h3 y20 ff4 fs1 fc0 sc1 ls0 ws0">•<span class="_ _2"> </span><span class="ff1 sc0">函数首部</span></div><div class="t m0 x1 h4 y21 ff2 fs1 fc0 sc1 ls0 ws0">Status InitList_Sq(SqList &amp;L);</div><div class="t m0 x1 h4 y22 ff2 fs1 fc0 sc1 ls0 ws0">Status CreatList_Sq(SqList &amp;L,int n);</div><div class="t m0 x1 h4 y23 ff2 fs1 fc0 sc1 ls0 ws0">void PrintList_Sq(SqList L);</div></div><div class="pi" data-data='{"ctm":[1.611830,0.000000,0.000000,1.611830,0.000000,0.000000]}'></div></div>
100+评论
captcha
    相关资源