-
huffmancode
哈夫曼编码程序，实现计算编码学中哈夫曼编码程序的源代码。(Huffman coding procedures, the realization of computing science Huffman encoding procedure s source code.)
- 2008-01-14 13:55:11下载
- 积分：1
-
strap_down_inertial_navigation
说明： 捷联系统C语言实现算法，已经过实验验证。(SINS C language algorithm, has been verified by tests.)
- 2008-11-20 16:50:37下载
- 积分：1
-
Maze_Engine
数据结构一书上 关于迷宫游戏的算法 (Book on data structure algorithms on maze game)
- 2010-06-12 09:47:17下载
- 积分：1
-
moni
数据结构 银行模拟问题 (Bank of simulation data structure problem)
- 2011-01-04 21:08:10下载
- 积分：1
-
Binary-Tree-Sort
二叉树排序，二叉树的递归调用排序，属于C语言源码(Binary Tree Sort)
- 2011-09-01 10:14:24下载
- 积分：1
-
Dijkstra
主要是DIJKSTRA经典算法，可以作为单个算法来读，也可以调用。(DIJKSTRA mainly classical algorithm can be read as a single algorithm can also be called.)
- 2010-09-25 17:37:40下载
- 积分：1
-
RBtree
使用C++/C语言实现的红黑树，对于数据结构的学习有所帮助。(Use red-black tree C++/C language for learning data structures helpful.)
- 2014-05-16 16:09:57下载
- 积分：1
-
44
说明： 给定程序中，函数fun的功能是：将a所指3×5矩阵中第k列的元素左移到第0列，第k列以后的每列元素依次左移，原来左边的各列依次绕道右边。
例如，有以下矩阵：
1 2 3 4 5
1 2 3 4 5
1 2 3 4 5
若k结果为2，程序执行结果为：
3 4 5 1 2
3 4 5 1 2
3 4 5 1 2
请在程序的下划线处填入正确的内容并把下划线删除，使程序得出正确的结果。
注意：源文件存放在考生文件夹下的BLANK1.C中
不得增行或删行，也不得更改程序的结构！
(A given program, function fun feature is: a 3 × 5 matrix referred to in the first k elements of the left column to move Section 0, the k elements of each column after column followed by the left, the original columns in the left turn Bypass on the right. For example, the following matrix: 123,451,234,512,345 If k is 2, the program execution results: 345,123,451,234,512 in the program underscore the right content at the fill and to remove the underscore, so that the program reach the right result. Note: The source files in the folder of BLANK1.C candidates are not allowed by the line or delete line, nor change the structure of the program!)
- 2011-08-11 07:53:10下载
- 积分：1
-
prim
普利姆算法用来求解最小生成树问题很容易，使得树的最小权值最小。(Prim algorithm used to solve the minimum spanning tree problem is easy, the minimum weight is the lowest of the tree)
- 2012-05-17 09:11:15下载
- 积分：1
-
FreeTree
无环连通图G=(V, E)亦称为自由树T，其直径是树中所有顶点之间最短路径的最大值，设计一个算法求T的直径(Acyclic connected graph G = (V, E) is also known as free tree T, whose diameter is the tree of shortest paths between all vertices maximum design an algorithm for the diameter of T)
- 2013-10-29 16:31:47下载
- 积分：1
