资源列表
matrix_mult
- 矩阵链的相乘的源代码，采用动态归还算法求解得到最优解。-chain matrix multiplication of the source code, the return of dynamic algorithm to obtain the optimal solution.
ordering5
- 基数排序：思想:先从数据的低位开始,进行分配,分成10个空间,分别存储位为,0,1,2,3...9 重复的对次地位操作,知道预定的高位,排序完成
poj_1699
- poj 1699的代码和方法说明,个人原创 -the codes and solution for poj 1699
erchashuzuichanglujing
- 本程序实现求二叉树的最长路径，输出该二叉树的最长路径数目以及该路径上的各节点-Binary tree for the program the longest path, the output of the binary tree the number of the longest path and the path of each node
therefft
- 改程序是建立在一维FFT的基础上编写的，改进的程序可以实现三维的快速傅里叶变换-3D-FFT
knapsack
- 背包问题，每类物品个数不限，使得总价值最大的动态规划算法。-Knapsack problem, the number of each type of goods not limited to, making the total value of the largest dynamic programming algorithm.
Coordinate
- 对观测资料进行坐标旋转，使X轴位于主风方向上。-Coordinate the observed data into a fixed Axis.
gaosi
- 这个程序用于求解一个矩阵的逆矩阵，是用高斯消去法解的-This procedure for solving a matrix of, is to use Gaussian elimination solution
JosephusProblem
- 这是约瑟夫问题,用循环链表实现的,其代码用头文件写出-This is Joseph problems linked with the implementation cycle, the code is written with the header file
8
- 八数码问题 单向启发式搜索 hash表 标准的八数码解-Eight-way digital issue standard heuristic search hash table of eight digital solution
tree
- 这是一个利用递归实现的二叉树源代码。- This is a by using the recursion binary tree of the realization of the source code.
Binary-Tree-Traversals
- 数据结构，用来建立与遍历二叉树的C语言程序-C language data structure used to create the binary tree traversal procedures