资源列表
bo11-1
- k路平衡归并的函数
SplineInterpolation
- 分析研究基于三种边界条件的样条插值算法并用程序实现其中一种边界条件-Analysis of three types of boundary conditions based on spline interpolation algorithms and procedures to achieve one of the boundary conditions
GAUSS
- Gauss Method for solving equals systems.
test
- 设计出的两个任意维数矩阵相乘的三种优化算法，包括矩阵分治和strassen算法-Design of the two matrices of arbitrary dimension of the three optimization algorithms, including matrix algorithm for partition and strassen
yidai
- 数值分析作业。各种迭代对方程的影响。包括误差分析，收敛发散性。-failed to translate
hafuman
- 实现哈夫曼编码 范式哈夫曼编码 实现定制集成电路 实现定制集成电路-realize Huffman Coding Huffman ；Albert Hofmann ；Ron Hofmeister
Order-Form
- 顺序表的简单操作，很容易理解的算法，程序比较小-Simple operation sequence table, it is easy to understand the algorithm, the program is relatively small
stackjas
- 一个顺序栈的创立及应用的源代码，不是很高端-A sequential stack creation and application source code is not very high
hashtable
- 哈希表的生成与利用哈希表来进行数据的检索与存储-Generate and use a hash table hash table to retrieve and store data
REBUILD-BINARY-TREE.cpp
- 我们知道如何按照三种深度优先次序来周游一棵二叉树，来得到中根序列、前根序列和后根序列。反过来，如果给定二叉树的中根序列和后根序列，或者给定中根序列和前根序列，可以重建一二叉树。本题输入一棵二叉树的中根序列和后根序列，要求在内存中重建二叉树，最后输出这棵二叉树的前根序列。 用不同的整数来唯一标识二叉树的每一个结点，下面的二叉树 中根序列是9 5 32 67 后根序列9 32 67 5 前根序列5 9 67 32 -We know how to
huffman
- Format HUFFMAN5 is the probability (or number of occurences) of each alphabet symbol
o1f
- order-1 move-to-front encoder written in java