登录
首页 » Others » diyizhang

diyizhang

于 2008-12-19 发布 文件大小:137KB
0 168
下载积分: 1 下载次数: 1

代码说明:

  数据的逻辑结构、存储结构及它们之间的关系和相应的基本操作运算的定义和实现。 本书围绕数据结构的三种基本结构:线性结构(第2-5章)、树形结构(第6章)和图形结构(第7章)展开讨论,研究解决如下问题:一个具体问题的逻辑数据结构是什么?适宜选用什么样的存储结构?采用什么样的操作实现算法效率更高? (Logical structure of data storage structure and the relationship between them and the corresponding basic operation and the realization of the definition of computing. The book data structure around three basic structure: a linear structure (the first chapter 2-5), tree-like structure (Chapter 6) and graphics structure (Chapter 7) initiate discussions to resolve the following issues: a specific problem What is the logic of the data structure? Suitable choice of what kind of storage structure? What kind of operation to achieve more efficient algorithm?)

文件列表:

diyizhang.ppt

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • using Java to write the data structure of the stiffness This algorithm is counti...
    用JAVA 写的数据结构 PILE 的算法,这种算法是法国大学老师算PILE 的一种方法.-using Java to write the data structure of the stiffness This algorithm is counting France braced University teachers a way.
    2022-03-21 13:26:30下载
    积分:1
  • 在一个圆形操场的四周摆放着n堆石子。现要将石子有次序地合并成一堆。规定每次只能选相邻的两堆石子合并成新的一堆,并将新的一堆石子记为该次合并的得分。试设计一个算...
    在一个圆形操场的四周摆放着n堆石子。现要将石子有次序地合并成一堆。规定每次只能选相邻的两堆石子合并成新的一堆,并将新的一堆石子数记为该次合并的得分。试设计一个算法,计算出将n堆石子合并成一堆的最小得分和最大得分,并分析算法的计算复杂度。-in a circle around the playground are placed n gravel pile. Is a stone should order to be merged into a heap. Stipulated that only elected adjacent to the pile of gravel into the new heap, and a new pile of gravel credited for the combined scores. Design a test algorithm to calculate n heap into a pile of gravel to the minimum score and the biggest score and analysis of algorithm complexity.
    2022-03-22 21:40:18下载
    积分:1
  • ioop rtyoirtopyrt optyi`
    fsdfsadfsdfsdfsdgdgdgfg dsfg sdfg dsf gsdfg sdfgsdfg gddflskgksd gdfsjklgjklsd kldfg jsdfj klgsfsgfsgjkl;sg dfg osdpg posdfig ;goipdf gdfpogsdf opsdf gspdo sdfpo gisdf gpsdfog ipsdfg sdfop gisdfpogg ;fsadfsdfsddfgdgfg dfgfgfg sdfg dsdfg gsdfg gsdfg sdfgsdfg gdfgsdfg gdgfgsdfg gdfsjkldfg jsdfj klgsfsgfsgjkl;sg dfg osdpg posggoipdf gdfpogsdf opsdf gspdo sdfpo gisdf gpsdfog ipsdfg sdfop gisdfpog fsdfsadfsdgfg dfgdgfg dsfg sdfg dsf gsdfg sdfgsdfg sdfgsdfg gfd g gjdflskgksd gdfsjklgsd kldfg jsdfj klgsfsgfsgjkl;sg dfg osdpg posdfig goipf gdfog opsdf gspdo sdfpo gisdf gpsdfog ipsdfpog;fsdfsadfsdfsdfsdgdgdgfg dsfg sdfg dsf gsdfg sdfgsdfg gddflskgksd gdfsjklgjklsd kldfg jsdfj klgsfsgfsgjkl;sg dfg osdpg posdfig ;goipdf gdfpogsdf opsdf gspdo sdfpo gisdf gpsdfog ipsdfop gisdfpog ;
    2022-07-20 07:02:24下载
    积分:1
  • 很好的学习软件。有C语言和Pascal语言两种形式。
    很好的数据结构学习软件。有C语言和Pascal语言两种形式。-good data structure learning software. C language and Pascal language in two forms.
    2022-06-28 17:19:36下载
    积分:1
  • the-shortest-path-of-chart
    求有向图的最短路劲,根据所给图的边长和顶点,建立有向图,以邻接表的方式存储,并编写程序求从有向图任一点出发的最短路径(according to the graph with sides and vertex, establish a directed graph, and write a program find the shortest path from one of the point of the chart )
    2020-07-16 11:28:50下载
    积分:1
  • db .* (pronounced dee
    db.* (pronounced dee-be star) is an advanced, high performance, small footprint embedded database for open source operating systems.-db .* (pronounced dee-be star) is an advanc ed, high performance, small footprint embedded database for open sou rce operating systems.
    2023-07-22 00:35:03下载
    积分:1
  • 操作系统中的文件是通过文件目录项来管理的,为了管理和查找的方便,按层次把文件目录项组织起来,同一层上的目录成该层上的目录,第一层为根目录,一下为各层子目录。...
    操作系统中的文件是通过文件目录项来管理的,为了管理和查找的方便,按层次把文件目录项组织起来,同一层上的目录构成该层上的目录,第一层为根目录,一下为各层子目录。 假设以一串字符代表一个文件,每个字符表示一个记录。 在建立上述目录结构的基础上,建立相应的管理系统并要求完成以下各项操作: 1. 一次建立各个文件 2. 查访两个用户的所有文件 3. 查访用户sun 是否有文件AB 4. 删除用户sun的文件AC,然后在分别查访两个用户的全部文件,检查是否已经删除文件AC 5. 撤销用户sun,并检查是否被删除 6. 删除用户sun的全部文件,然后在撤销sun用户,在查访用户sun, 检查其是否已被撤销。 在建立一个新用户及新用户的两个文件,然后查该两个用户的所有文件-operating system, the paper is to document catalog items to the management, in order to manage and facilitate the search, according to the document level directory entries organizations, the same floor on which constitute the directory contents on the floor, the first layer of the root directory to look for levels of subdirectories. Assuming that the representative of a string of characters, each character expressed a record. In establishing the directory structure on the basis of the establishment of a corresponding system of management and asked to accomplish the following : 1. Once established two separate files. Visits to the two users of all three docum
    2022-01-26 01:47:05下载
    积分:1
  • MS ACCESS 库文件的压缩 Delphi 实现
    MS ACCESS 数据库文件的压缩 Delphi 实现-MS ACCESS database file compression Delphi realize
    2022-01-25 16:10:59下载
    积分:1
  • tree data structure formation and operation of the algorithm
    数据结构 之树的生成与操作 算法-tree data structure formation and operation of the algorithm
    2022-10-23 13:00:03下载
    积分:1
  • 01 knapsack problem to achieve the most simple, can do more in its expansion, I...
    01背包问题最简单实现,可在其上做更多的扩展,不知道可否不用递归用堆栈-01 knapsack problem to achieve the most simple, can do more in its expansion, I do not know can not use recursive stack
    2022-12-24 12:20:04下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载