搜索资源列表
post-office-(fenzhisuanfa)
- post office 邮局选址问题 分治算法,能运行,我已经调好的-post office post office location problem Divide and Conquer Algorithm, can run, I have a good tune
Max-and-Min
- 运用递归与分治策略同时找到一组数据的最大最小数,算法复杂度为n*logn-The use of recursive divide and conquer strategy with the same time find a set of minimum and maximum number of data, the algorithm complexity is n* logn
Divide-and-conquer-algorithm
- 分治算法是基于多分枝递归的一种算法设计模式。分治算法递归地把一个大问题分解为多个类型相同的子问题,直到这些子问题足够的简单能被直接解决。最后把这些子问题的解结合起来就能得到原始问题的解。-Divide and conquer algorithm is based on a multi-branch recursive algorithm design pattern. Divide and conquer algorithm recursively to a large problem into
algorithm_report
- 算法设计报告5个重要算法,包括贪心,回溯,动态规划,分支限界,分治法-Algorithm design report five algorithms, including greedy, backtracking, dynamic programming, branch and bound, divide and conquer
recursive-divide-and-conquer
- 算法设计课件(第二章递归与分治),主要讲述递归与分治-Algorithm courseware design (Chapter II recursive divide and conquer), focuses on the recursive divide and conquer