搜索资源列表
manlifa
- 算法设计(蛮力法) 算法设计(蛮力法)-algorithm design (brute force) algorithm design (brute force)
cpp
- 用蛮力法解决的Acm icpc试题（求矩阵每一列列和的最小值）。
manlifa
- 算法设计(蛮力法) 算法设计(蛮力法)-algorithm design (brute force) algorithm design (brute force)
cpp
- 用蛮力法解决的Acm icpc试题（求矩阵每一列列和的最小值）。-Using brute force method to solve the Acm icpc questions (each matrix rows and the minimum value).
knapsackproblems
- 本程序用MFC实现了背包问题中贪婪法，动态规划法，蛮力法，分支界限法的可视化-This procedure using MFC in a knapsack problem greedy method, dynamic programming method, brute force method, branch visualization limits of the law
chuangxinjijing
- 平方幻方的程序实现 (1)研究了幻方和平方幻方的性质。写出了1—n*n的幻方程序 (2)明白要写这样的程序，需要用蛮力法来加以解决，这样对问题的解决带有极大的盲目性，完全是一个NP问题。 -Square magic square program (1) studied the magic square and the square of the nature of magic squares. Write a 1-n* n
KitBag
- 分治法和蛮力法求解最近点对问题,不好意思中文传不了，改传背包问题了。-leastport
MaxSum_ML
- 最大子段和实验之蛮力法，包括程序运行时间计算，C++表述-The largest sub-segment and experiments brute force method, including the run time calculation, C++ statements
01bag
- 用蛮力法，回溯法，分支限界法求解背包问题-With the brute force method, backtracking, branch and bound method for solving knapsack problem
biggest
- 用蛮力法，分解质因数法，欧几里得算法分别求解最大公约数问题-With the brute force method, the quality factor decomposition method, the Euclidean algorithm for greatest common divisor problem solving, respectively
zuijindui
- 用蛮力法和分治法解最近对问题以及对算法时间性能及运行结果的分析 -And sub-rule by brute force method of solving the problem, as well as the recent performance of the algorithm and running time analysis of the results
shortestpath
- 用蛮力法和分治法求最近点对的问题-用蛮力法和分治法求最近点对的问题............
1
- 0/1背包问题，C++实现，算法实现源代码，蛮力法实现源程序，-0/1 knapsack problem, C++ implementation, algorithm source code, brute force method to achieve source,
MinDistance_PointPair
- 用java实现的平面上最近点对的查找，包括蛮力法和分治法的实现。-Java implementation of the plane with the nearest point on the search, including the brute force method and the divide and conquer implementation.
004
- 用蛮力法和回溯法求解子集和数问题，大家可以参考借鉴一下-Use brute force method and backtracking to solve a subset of several issues, we can look for references
algorithm2
- 最大子段和/三种方法/c++语言/(内有报告) 蛮力法，动态规划法，分治法。 可比较时间，随机输入数据...... -The largest sub-segment and/three methods/c++ language/(within report) brute force method, dynamic programming, divide and conquer. Comparable time, the rand
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
MaxOfSubSegSum
- vc求最大子串和问题 分别采用分治法和蛮力法很好的解决了这个问题-vc find the largest substring and problems, and were used to divide and conquer a good brute force method to solve this problem
BUPT-alg-lab1
- 1. 实验题目 用蛮力法解决0/1背包问题 2．实验目的 ⑴ 深刻理解并掌握蛮力法的设计思想； ⑵ 提高应用蛮力法设计算法的技能； 3. 实验要求 应用蛮力法解决0/1背包问题 ； 对所设计的算法进行时间复杂性分析 包含结婚算法和王伯卖鱼的选做题和实验报告(1. experimental topics Solving 0/1 knapsack problem by brute f
Maxsum
- 用蛮力法、分治法、动态规划法实现最大子段和(There is MaxSums in three way.)