搜索资源列表
Math
- Matlab算法分析与设计程序，包括很多搜索算法的源程序。-Matlab algorithm analysis and design procedures, including many search algorithm of the source.
ChessBoardCoverGameFrame
- java棋盘覆盖实现演示程序，算法分析与设计经典例题-java demo board to achieve coverage
ChessBoard
- ＭＦＣ的棋盘覆盖问题，算法分析与设计的例题，实习的典型范例-MFC-board cover problem, algorithm analysis and design example, a typical example of practice
mergeSort
- mergeSort,合并排序，算法分析与设计-mergeSort
fakecoin
- 采用算法分析与设计中的减治法解决假币问题-use the logical analasys and design method to solve the fake coin
CLOSESTPAIR
- 算法分析与设计之CLOSESTPAIR算法实现-CLOSESTPAIR
7-27
- 算法分析与设计之7-27（贪心算法）算法实现-analysis 7-27
Algorithm
- 算法分析与设计 (美国)Michael.T.Goodrich 清晰版-Algorithm Analysis and Design (United States) Michael.T.Goodrich clear version
MaxClique
- 算法分析与设计中的最大团问题，程序给出了详细的说明，下载可以直接运行-Algorithm analysis and design of the maximum clique problem, the program gives a detailed descr iption, download can be run directly
ChessBoardCover
- 经典的算法分析与设计课程中的棋盘覆盖问题，java代码，具有很高的参考价值-Classical algorithm analysis and design course covering the board, java code, with a high reference value
subsequence
- 这是用c 写的关于最长公共子序列的一个算法，是学习算法分析与设计时做的一个实验，希望对初学者有用呵（原来的名字是“最长公共子序列”，因为上传的原因改成现在的名字）-This is c written about one of the longest common subsequence algorithm, learning algorithm is to do analysis and design an experiment, I hope useful for beginners O (t
code
- 这是算法分析与设计这书的课后习题解答代码。-This is the algorithm analysis and design after-school exercise book answer code.
01backpack
- 算法分析与设计中的01背包问题，采用合并排序方法。-《Algorithm analysis and design》 of the 01 knapsack problem, using merge sort method.
bound
- 算法分析与设计 利用分支界限法计算载重问题-Calculate the weight using branch and bound problems
n-queens-graphical
- n-queens graphical，是算法分析与设计里N皇后的c+=代码，程序将问题进行了图形化-n-queens graphical
bigTuan
- 算法分析与设计 最大团问题 G的最大团是指G中所含顶点数最多的团。 无向图的最大团和最大独立集问题都可以看作是图G的顶点集V的 子集选取问题可以用回溯法在O(n*(2^n))时间内解决。-Algorithm analysis and design problem G, the biggest group the biggest group is the maximum number of vertices of G contained in the group. Undirect
huffman
- 算法分析与设计基础课程大型实验周做的，用贪心算法实现的Huffman编码，-Algorithm analysis and design of large-scale experiment-week basic course to do with the greedy algorithm of Huffman coding,
algorithm_report
- 算法分析与设计报告，用java编写的4个常见的算法小程序。包括矩阵相乘问题，0/1背包问题，删数问题，和旅行商问题。-Algorithm analysis and design reports using java prepared four common algorithm applet. Including matrix multiplication problem, 0/1 knapsack problem, delete a few problems, and traveling sal
NearestPoint
- 算法分析与设计经典问题，用分治法求最近点对，并与蛮力法做对比-Classical algorithm analysis and design problems with the divide and conquer method for the last point, and compared with the brute force method to do