-
2.2
已知线性表中的元素以值递增有序排列，并以单链表作存储结构。试写一高效的算法，删除表中所有值大于mink且小于maxk的元素（若表中存在这样的元素）同时释放被删结点空间，并分析你的算法的时间复杂度（注意：mink和maxk是给定的两个参变量，它们的值可以和表中的元素相同，也可以不同）。(Known linear elements in the table to the value increments ordered, and a single list for the storage structure. Try to write a highly efficient algorithm to delete all values greater than mink and maxk elements smaller than (if there is such an element in the table) while the release of the deleted node space, and analyze your time complexity of the algorithm (Note: mink and maxk is given two parameters variables, their values and elements in the table can be the same or different).)
- 2015-04-11 23:11:41下载
- 积分：1
-
03
说明： 《妙趣横生的算法》第三部分原书附带代码程序，绝对属实(" Algorithm for fun," the third part of the original program with the code, the absolute truth)
- 2011-04-24 01:36:18下载
- 积分：1
-
Campus-navigation-problem
校园导航问题，设计你的学校的平面图，至少包括10个以上的景点（场所），每两个景点间可以有不同的路，且路长也可能不同，找出从任意景点到达另一景点的最佳路径（最短路径）。
要求：
（1）以图中顶点表示校园内各景点，存放景点名称、代号、简介等信息；以边表示路径，存放路径长度等有关信息。
（2）为来访客人提供图中任意景点相关信息的查询。
（3）为来访客人提供任意景点的问路查询，即查询任意两个景点之间的一条最短路径。
（4）修改景点信息。
(Campus navigation problem, the design of your school s plan, at least more than 10 attractions (places), between every two spots can have a different way, and the long road may be different, to find spots to reach from any other attractions best path (shortest path).
Requirements:
(1) graph vertices represent various campus sites, storage sites name, code, profile and other information the side that path, the path length of storage of information.
(2) the figure for visiting any sites offering information about the query.
(3) any attractions for visiting guests ask queries of that query any two of the shortest path between sites.
(4) modify the attractions information.)
- 2011-08-12 10:34:14下载
- 积分：1
-
MyGPS
1>实现可以随意浏览任一景点的介绍。（功能一）
2>可以给出任意两个景点的最短距离及其路线。（功能二）
3>可以查看任一景点热度，并可以对对所有景点热度（访问次数）进行排序。（功能三）
4>每个景点相关内容从文件读取，实现对文件操作的练习。
(1> implementations can feel free to browse introduce 任一景 points. (Function a)
2> You can give the shortest distance and route between any two attractions. (Function b)
3> You can view Renyi Jing point heat, and heat can all attractions (visits) to be sorted. (Function c)
4> each spot related content file reading, to achieve the file operations exercises.)
- 2015-11-12 22:16:01下载
- 积分：1
-
sort.cpp
各种排序的模板实现，并分析了各种实现的时间复杂度及改进办法(Templates of various sort, and analyze the time complexity of the various implementations and ways to improve)
- 2012-04-14 03:08:18下载
- 积分：1
-
sf_2014320164457
数据结构中的许多东西,包括头文件、例题、习题等等(Data structure many things, including the header files, examples, exercises, etc.)
- 2014-04-03 15:24:34下载
- 积分：1
-
Huffman
说明： 数据结构：Huffman编码。哈夫曼编码是哈夫曼树的一个应用。哈夫曼编码应用广泛，如JPEG中就应用了哈夫曼编码。 哈夫曼树又称最优二叉树，是一种带权路径长度最短的二叉树。(Data structure: Huffman coding. Huffman coding is an application of the Huffman tree. Huffman coding is widely used, such as JPEG in the application of the Huffman coding. Huffman tree, also known as the best binary tree is a weighted shortest path length binary tree.)
- 2011-03-29 22:44:59下载
- 积分：1
-
lianbiaoqiujiaoji
该程序是数据结构中以链表存储形式来求两个集合的交集，用C++语言描述的(The program is the form of a linked list stored in the data structures to seek the intersection of two sets, C++ language to describe)
- 2012-04-24 22:35:37下载
- 积分：1
-
sstring
利用串来比较数据大小，代码中有两个串，通过串来比较大小(
10/5000
Use the string to compare the data size)
- 2016-12-20 17:05:29下载
- 积分：1
-
a-linked-list-and-related-processing
链表的建立及相关处理，包括排序，删除，初始化，增加，删除等等，且程序已运行通过。(The establishment of a linked list and related processing, including sorting, delete, initialization, increase, delete, etc., and the program has been run through
)
- 2014-01-13 23:56:27下载
- 积分：1
