资源列表
simplex
- 利用单纯形法求解线性规划，输入为标准型的线性规划，求解得到最优解和最优值
matrixChain
- 动态规划法解矩阵连乘积的最优计算次序问题。按照分解最优解的结构，建立递归关系，计算最优值，构造最优解4个步骤
Greed
- 利用贪心算法解决“部分背包问题”。这是个经典算法，实现的也比较完善，易用而且BUG少。-This code is about the "Knapsack problem".Our policy is the "Greedy Algorithm".It s easy to use & has nearly no BUG.
sort
- 将数组分为小块进行插入排序，然后用合并排序的方法将分块的数组进行排序。-The array is divided into small pieces for insertion sort, and then use the combined approach will be to sort the array sort block.
dijkstra
- Dijkstra算法 邻接表向量实现（求最短路径及具体走法） -Dijkstra algorithm to achieve adjacency list vector (for the shortest path and the specific moves)
main
- 倍增法构建后缀数组 求最大重复子串的C程序-Constructing the suffix array multiplication seeking to repeat the largest sub-string C-program
NaiveBayes
- This is a genetic algorithm.
FFbp
- Training a 3 layers feed forward neural network using back propagation algorithm
foot
- 足球联赛采用主客场双循环赛制，胜一场得3分，平局各得1分，负一场得0分，联赛排名以积分多者在前，当两队（或多队）积分相同时，则净胜球（即进球数与失球数之差）多者在前，若净胜球相同，则进球数多者在前，若仍相同，则抽签或踢附加赛决定名次（这在联赛结束后进行，联赛未结束则两队名次并列，本程序不做这方面要求）。程序统计最近一轮比赛后，各队积分及排名。-Football League home and away double round-robin, a win 3 points, a draw 1 po
9-reint2d.m.tar
- This a two dimensional level set code that constructs signed distance function using a first order Godunov scheme.
heapsort
- 《算法导论》第三版中堆排序伪码的C语言实现-"Introduction to Algorithms" third edition heap sort pseudo-code in C language
Combine-turn
- 软件技术基础中关于数据结构的问题：通过C语言来实现 顺序表的合并。-combine the data-turns by c.