Location:
Search - fenzhifa
Search list
Description: 算法设计与分析基础（分治法）
算法设计与分析基础（分治法）-algorithm design and analysis of the basis (the partition) algorithm design and analysis of the basis (the partition)
Platform: |
Size: 6759 |
Author: king |
Hits:
Description: 算法设计与分析基础（分治法）
算法设计与分析基础（分治法）-algorithm design and analysis of the basis (the partition) algorithm design and analysis of the basis (the partition)
Platform: |
Size: 6144 |
Author: king |
Hits:
Description: 棋盘覆盖问题，是用分治法实现的。基本上全是数字实现的。虽然简单，但是这是为了说明一个算法的设计问题-Board cover problem is the use of sub-rule method to achieve. Basically, all the figures attainable. Although simple, but this is to illustrate the design of an algorithm
Platform: |
Size: 1024 |
Author: 刘锦瑞 |
Hits:
Description: 分治法的基本思想，掌握递归程序编写方法；使用分治法编程，求解线形序列中第k小元素。-Separation of the basic ideas, grasp the recursive programming methods the use of sub-rule law programming, solving linear sequence of the first k small element.
Platform: |
Size: 17408 |
Author: chenchen |
Hits:
Description: 这是分治法的小程序,来自书本上的作业.
没什么大的改变.看看就好-This is a small sub-rule law procedures, from the books work. No big change. Look like
Platform: |
Size: 2048 |
Author: cmwwmc |
Hits:
Description: 分治法快速排序使用分治法快速排序分治法快速排序 使用分治法快速排序-Quicksort for fenzhifa，you use youkonowQuicksort for fenzhifa，you use youkonowQuicksort for fenzhifa，you use youkonow
Platform: |
Size: 1024 |
Author: |
Hits:
Description: 分治法的应用 将序列A(0：n-1)中元素按照升序排序方法:归并排序和快速排序((1)对于快速排序,主元采用三者A(low),A(high),A((low+high)/2)中其值居中者-Divide and conquer the application of the sequence A (0: n-1) elements in ascending sorted by: Merge sort and quick sort ((a) for Quick Sort, the main element with three A (low), A (high) , A ((low+ high)/2) in the middle by its value
Platform: |
Size: 1024 |
Author: xiaolu |
Hits:
Description: 用c++实现分治法算法的最近点对问题（在VS2008平台上）-Using c++ implementation of divide and conquer algorithm for the nearest point of the problem (in VS2008 platform)
Platform: |
Size: 30720 |
Author: yan |
Hits:
Description: 这是用分治法解决循环赛日程安排问题，分治法的最主要的特征就是分而治之-This is divide and conquer method to solve the problem of round-robin schedule, divide and conquer the most important feature is divide and conquer
Platform: |
Size: 1024 |
Author: 吴娜 |
Hits:
Description: 分治法的思想是将一个难以直接解决的大问题分割成一些规模较小的几个相似的问题来解决，分治法的求解过程是将整个问题分解成若干个小问题后分而治之，如果分解得到的子问题相对来说还太大，则可反复使用分治策略将这些子问题分成更小的同类型子问题，直至产生出方便求解的子问题，必要时逐步合并这些子问题的解，从而得到问题的解。分治法的求解通常会用到递归，通常会说分治法是一种找大规模问题与小规模问题关系的方法，是递归设计方法的一种具体策略。分治法的基本步骤在每一层递归上都有三个步骤：
① 分解：将原来的规模相对较大的问题分解为规模较小的、相互独立的、与原问题形式相同的子问题。
② 解决：若子问题规模较小而容易解决则直接解决，否则再继续分解为更小的子问题，直到容易解决。
③ 合并：将已求解的各个子问题的解，逐步合并成原问题的解。
当求解一个输入规模为n并且取值比较大的问题时，可以使用分治法提高解决问题的效率。
-The idea is to divide and conquer difficult to directly solve a big problem is divided into some smaller number of similar problems to solve, divide and conquer the whole problem solving process is divided into several small problems of divide and rule, if the decomposition sub-problems are too big, relatively speaking, you can divide and conquer strategy of repeated use of these sub-problems into smaller sub-problems of the same type, until the child produces easy to solve the problem, if necessary, to gradually merge the sub-solution of the problem, to be the solution. Divide and conquer method is usually used for solving recursive, divide and conquer is usually said to find large-scale problems is a problem with the relationship between small-scale method is a recursive design specific strategies. The basic steps to divide and conquer recursion on each floor has three steps:
① decomposition: the relative size of the original large problem into smaller, independent, original proble
Platform: |
Size: 1024 |
Author: ss |
Hits:
Description: 分治算法的一些源码，可以供大家学习一下，介绍分支算法的逻辑
-Divide and conquer algorithm for some of the source, you can look for them to learn
Platform: |
Size: 33792 |
Author: 非官方 |
Hits:
Description: 分治法排序。 分治策略是：对于一个规模为n的问题，若该问题可以容易地解决（比如说规模n较小）则直接解决，否则将其分解为k个规模较小的子问题，这些子问题互相独立且与原问题形式相同，递归地解这些子问题，然后将各子问题的解合并得到原问题的解。-Divide and conquer sort
Platform: |
Size: 858112 |
Author: raul |
Hits:
Description: 此为对分治法大整数相乘的一个改进，能够给对刚开始学习算法的人一个了解的机会-This is an improved large integer multiplication of divide-and-conquer method to the beginning of the learning algorithm an understanding of the opportunity
Platform: |
Size: 2048 |
Author: 石楠轩 |
Hits:
Description: 通过使用分治法进行二分搜索,代码已验证可放心使用-Binary search by using the divide-and-conquer method, the code can be assured Verified ~ ~
Platform: |
Size: 4096 |
Author: Ein |
Hits:
Description: 分治法求数组中最大值和最小值，与普通方法比较-Divide and conquer method for the maximum and minimum values in the array, compared with the conventional method
Platform: |
Size: 1024 |
Author: kaylee |
Hits:
Description: 计算机算法分析里面分治法中很多算法的源码-Computer algorithm analysis, many of which divide and conquer algorithm source code
Platform: |
Size: 1702912 |
Author: 王重阳 |
Hits:
Description: 这是分治法的小程序,来自书本上的作业.没什么大的改变.看看就好-This is a small sub-rule law procedures, the books work. No big change. Look like
Platform: |
Size: 2048 |
Author: xin245918 |
Hits: