资源列表
matrix_mult
- 矩阵链的相乘的源代码，采用动态归还算法求解得到最优解。-chain matrix multiplication of the source code, the return of dynamic algorithm to obtain the optimal solution.
metrics
- 用牛顿法求解矩阵特征值，具体最 大 特征值迭代变量，分析了使用最 小 特征值迭代变量迭代时发散的原因。程序中有详细注释
ordering5
- 基数排序：思想:先从数据的低位开始,进行分配,分成10个空间,分别存储位为,0,1,2,3...9 重复的对次地位操作,知道预定的高位,排序完成
Magnus4
- 用magnus展开求解延迟微分方程！这是一种保结构算法。通过两次转换得到的！-Magnus started with delay differential equations to solve! This is a security structure algorithm. Obtained through the conversion of two!
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
knapsack
- 背包问题，每类物品个数不限，使得总价值最大的动态规划算法。-Knapsack problem, the number of each type of goods not limited to, making the total value of the largest dynamic programming algorithm.
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
zuichanggonggongzichuan
- 本代码描述了寻找两个字符串的最大公共子串问题，算法描述清楚，适合初学者。-This code describes the search for two strings greatest common subsequence problem, the algorithm clearly described, suitable for beginners.
main
- 基数排序是重要的排序算法，在很多重要的场合都会用到-Radix sort is a sorting algorithm is important, in many important occasions will be used