-
binarytree
二叉树的操作，涉及到三种顺序的遍历，树的凹入表示法，转化为一维数组储存，节点的计数，以及中序线索化。(Binary operation, involving three kinds of the order of traversal, tree concave representation into a one-dimensional array of storage, the node count, as well as in the threaded sequence.)
- 2011-05-24 20:31:13下载
- 积分：1
-
LongestIncreasingSequence
找出数组A中最长的递增序列的长度，使用动态规划算法，复杂度为O(N*N)。(Find the longest increasing sequence)
- 2011-09-05 17:36:27下载
- 积分：1
-
Ex3
c++实现的静态链表 可以从屏幕输入来构建静态链表 数据结构重要的部分(c++ implemented statically linked list can be input from the screen to the important part to build a static linked list data structure)
- 2012-11-27 15:19:25下载
- 积分：1
-
插入排序
根据所选定的字符顺序，按照从大到小的规则，对字符进行插入排序，(Insert and sort characters)
- 2020-06-22 12:40:01下载
- 积分：1
-
Cpp1
校园导游，可以选择景点序号来了解景点，通过选择两点可计算最短距离和最近路线。(Campus tour guide, you can choose the attractions serial number to understand the attractions of by selecting the shortest distance can be calculated and the recently routes.)
- 2012-06-20 21:57:32下载
- 积分：1
-
FIFO-c
说明： 操作系统先来先服务调度算法模拟（C描述）(Operating a first-come first-served scheduling simulation (C description))
- 2010-04-13 00:02:35下载
- 积分：1
-
jose
约瑟夫环（约瑟夫问题）是一个数学的应用问题：已知n个人（以编号1，2，3...n分别表示）围坐在一张圆桌周围。从编号为k的人开始报数，数到m的那个人出列；他的下一个人又从1开始报数，数到m的那个人又出列；依此规律重复下去，直到圆桌周围的人全部出列。通常解决这类问题时我们把编号从0~n-1，最后结果+1即为原问题的解。
(Josephus (Josephus problem) is the application of a mathematical problem: Given n individuals (with numbers 1,2,3 ... n respectively) sitting around a round table. From the number of people gettin k, number of the m man out of the line he s the next person and a number of gettin number to m the man was out of the line and so the law is repeated until the round table were all out of the column. We numbered 0 ~ n-1, the final result is the original problem solution+1 usually solve these problems.)
- 2015-01-09 17:28:41下载
- 积分：1
-
hash
使用全排列实现hash，看看吧相信对大家会有些帮助的(Full array hash)
- 2011-08-19 21:25:34下载
- 积分：1
-
BinarySearchTree
在Visual Studio 2008运行成功 数据结构 二叉查找树的类(In Visual Studio 2008 running a successful binary search tree data structure classes)
- 2013-07-23 22:04:29下载
- 积分：1
-
Test6
最短路径算法。
用无向带全图的邻接矩阵存储图，确定从源点出发到其它各点的最短路径。
输入：图中包含的顶点数n 边数m， 各边权值，用邻接矩阵或者邻接表存储。
输出：源点到其它各点的最短路径值。(Shortest path algorithm. Adjacency matrix storage with undirected graph with a full figure, determine the starting point of the shortest path from the source point of each other. Input: Vertices figure included n the number of edges m, the weight of each side, with the adjacency matrix or adjacency table storage. Output: source shortest path to value each other points.)
- 2014-05-11 17:05:37下载
- 积分：1
