搜索资源列表
bc_mfc
- 使用Binomial Cofficient的演算法,並以Divide-and-Conquer以及Dynamic Programming的方式來實作,並以比例尺來做比較-use of the algorithms, and Divide - and-Conquer and Dynamic Programming is the way to make and do more to Scale
最近点对问题，分别用蛮力法和分治法进行了求解
- 最近点对问题，分别用蛮力法和分治法进行了求解，算法已经做过优化-Nearest point on the issue, respectively, and with brute force method for solving divide and conquer algorithm optimization has been done
RPG_zhengfu.rar
- 手机版网络游戏 征服,同时又单机版,有详细的注释和设计文档,是中级者学习的好资料,To conquer the mobile phone version of online games, at the same time, stand-alone, there are detailed notes and design documents, is to acquire a good middle-level information
7度征服1.6版E语言登陆器
- 7度征服1.6版E语言登陆器,动态IP都能开服-E 1.6 7 degrees to conquer the language landers, dynamic IP services can be opened
NCoinsProblem
- n枚硬币问题，采用分治法中的三分算法，很好的解决了n个硬币的问题-n coins problem, using divide and conquer algorithm in the third, a good solution to the problem of n coins
POINT
- 用分治法找一个平面内的最接近点对。时间复杂度为O（nlogn）.-Using a divide and conquer to find the closest point of the plane pair. Time complexity is O (nlogn)
post-office-(fenzhisuanfa)
- post office 邮局选址问题 分治算法，能运行，我已经调好的-post office post office location problem Divide and Conquer Algorithm, can run, I have a good tune
nearestPointPair
- 给定一个点数组，比较求解最近点对的一般算法和分治法的效率。-Given a point group, compared to solve the nearest point on the general algorithm and divide and conquer efficiency.
zfwg
- 征服商业无限制网关，里面有登陆器。下载请杀毒，不要骂我。-Conquer the business restrictions gateway, which has landers. Download your anti-virus, do not scold me.
package
- Delaunay 分治法进行三角剖分，同时对剖分后的三角面片进行动画模拟。-Divide and conquer Delaunay triangulation, while triangles after subdivision animated simulation.
dazhengshu
- 本人上传的是用分治法实现的大整数算法，采用的是数组形式。-I uploaded is to use divide and conquer to achieve a large integer arithmetic, using the array form.
Delaunay
- Delaunay 分治算法三角网格剖分！-Source code for DeWall, a divide and conquer 3d Delaunay
1
- 分治算法解士兵站队问题，ACM大学生程序设计题。-Divide and conquer algorithm for solving the soldiers stand in question, ACM Collegiate Programming problem.
分治算法
- 君主和殖民者们所成功运用的分而治之策略也可以运用到高效率的计算机算法的设计过程中。本章将首先介绍怎样在算法设计领域应用这一古老的策略，然后将利用这一策略解决如下问题：最小最大问题、矩阵乘法、残缺棋盘、排序、选择和一个计算几何问题——找出二维空间中距离最近的两个点。 本章给出了用来分析分而治之算法复杂性的数学方法，并通过推导最小最大问题和排序问题的复杂性下限来证明分而治-monarchy and colonialists who have successfully used the divid
ajax
- 征服ajax源码，包含基本的框架介绍，各自框架下的例子介绍。-Conquer ajax source that contains the basic framework introduced under the framework of their respective examples.
quick_so
- quicccck sort using divide n conquer-quicccck sort using divide n conquer...
MyDib
- Dib类的封装，因为MFC中不提供任何Dib的支持，为了方便复用，这里设计一个Dib类，这个类的封装十分复杂，这里采取分而治之的方法，对关键部分进行了单独讲解。-Dib type of package, because MFC does not provide any support Dib, in order to facilitate reuse, where the design of a Dib category, this type of package is very complex
recurs
- /* Divide and Conquer */ /* Find minimum and maximum from a given series of numbers */ /* by using above said policy */ gcd fibonacci-/* Divide and Conquer*/ /* Find minimum and maximum from a given series of numbers*/ /* by using
addition3
- divide and conquer method of assigning one processor to each node in a tree for adding numbers (Lecture 6 Chapter 4 section 4.1.2) in terms of communication, computation, overall parallel execution time, speedup, and efficiency.
CoAccountServerKeygensrc
- Conquer Acc server Cracker