搜索资源列表
strings
- 字符串的算法：字符串匹配，Brute Force算法
brute
- ANN的brute算法，用于检查ANN算法的正确性-brute-force algorithm for ANN
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 magic square of the procedure
Nearest
- 分别利用分治法及穷举法求解最近点对问题，输出查找结果及比较次数。-Use, respectively, sub-rule method and brute-force method for solving the nearest point of the problem, the output and compare the number of search results.
MaxSum_ML
- 最大子段和实验之蛮力法，包括程序运行时间计算，C++表述-The largest sub-segment and experiments brute force method, including the run time calculation, C++ statements
Maze(Stack)
- 应用栈求迷宫通路，用的是“穷举求解”的方法，即从入口出发，顺某一方向向前探索，若能走通，则继续往前走；否则沿原路退回，换一个方向再继续探索，直至探索到通路为止。-Application stack requirements maze path, using a "brute-force solving" approach, starting from the entrance, along a forward direction to explore, if we go through, the
1
- 最短哈密尔顿图，穷举法，递归调用， 深度优先查找-The shortest Hamiltonian, brute-force method, the recursive call, depth-first search
Odometer-like-Brute-Force-Counter-
- 给定一组数字排序，打印所有的计数顺序。 -Given a set of numerical order, print all the counting sequence.
migongqiujie
- 数据结构中，栈的运用举例，迷宫求解。利用穷举求解的方法-Data structure, the use of the stack example, maze solving. The use of brute force method of solving
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
KnapSack
- 蛮力、动态规划、回溯、分支限界四种算法求解0/1背包问题-Four algorithms（brute force, dynamic programming, backtracking, branch and bound ） to solve 0/1 knapsack problem
Power
- 分别用蛮力法、分治法、减治法求a的n次方，并比较运行时间-Respectively with brute force method, partition method, reduce the power comes for a ^ n,and compare the running time.
MaxSum
- 用蛮力法、分治法和减治法求最大子段和问题并比较运行时间。-With the brute force method, divide and conquer method for the treatment and reduce the largest sub-segment and the issues and compare the running time.
ClosestPoints
- 分治法和蛮力法求最近对问题及其时间复杂度比较-Divide and conquer method and the brute force method for the recent problems,and comparing the running time.
knapsack-problem
- 原创，背包问题的四种解法，回溯法，动态规划法，以及两种蛮力法，C++代码，编译运行通过，结果正确，可以比较各种方法的效率。-The original, four solutions of the knapsack problem, backtracking, dynamic programming, and two brute force method, C++ code, compile, run through, the result is correct, you can compare
Pattern-matching
- 实现字符串的匹配，有常见的蛮力算法，kmp算法，Horspool算法,Boyer-Moore算法-String matching, common brute force algorithm, kmp algorithm, Horspool algorithm, the Boyer-Moore algorithm
Brute-force-algorithm
- 穷举算法，VC中的经典程序之一，适合初学者，-Brute-force algorithm, the the of the classic procedures in in the the VC, suitable for beginners
Bag
- 0-1背包问题的解答,0-1背包问题的一个简单的解答，算法不是很好，蛮力算法-0-1 knapsack problem answers to the 0-1 knapsack problem with a simple answer, the algorithm is not very good, the brute force algorithm
Screening-method
- 选择排序 排序问题中的蛮力法 算法设计与分析-Selection sortThe scheduling problem with the brute force methodDesign and analysis of algorithms
Brute-Force
- 通过Brute-Force匹配算法，实现字符串的查找功能，寻找最长的真子串。-By Bruteforce matching algorithm, string search function to find the longest substring true.