搜索资源列表
Commonalgorithms
- 一些常用的算法设计方法和C++环境下的实现方法。主要包括：迭代法、穷举搜、索法、递推法、递归、回溯法、贪婪法、分治法 -Some commonly used algorithm design methods and C environments are implemented. These mainly include: iterative method, exhaustive search, rope method, recursive method, recursion, backtra
CLOSESTPAIR
- 使用分治算法找到平面上的n各点的集合S中最小距离的一个点对-Use Divide and Conquer Algorithm to find the plane of the set of n points S in the minimum distance of a point on the
fenzhifazuiyoujiewenti
- 分治法解决最优解问题，很好很强大 分治法解决最优解问题，很好很强大-Divide and conquer the optimal solution to solve the problem, very good very strong Oita conquer the optimal solution to solve the problem, very good very strong
fenshu
- 算法分析中的分书问题，运用分治法解决的经典问题-Analysis of algorithms written in the sub-problem, the use of divide and conquer to solve the classic problem
suanfa
- 常用算法,为初学者服务,简单易懂,常用的算法设计方法： 数值算法：迭代法、递归法、插值法等； 非数值算法：分治法、贪婪法、回溯法等。-Commonly used algorithms, for beginners service, easy to understand, common algorithm design methods: numerical algorithms: iterative method, the recursive method, interpolation m
fenzhifa
- 分治法的应用 将序列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 elemen
webQQ
- 《征服ASP_NET Ajax典型应用》书中的关于网页版qq聊天-" Conquer ASP_NET Ajax Typical Applications" on the web version of the book qq chat
Decfunction
- 算法分析实验 算法分析减治法 8枚硬币问题-Experimental analysis of algorithms analysis of algorithms by-conquer eight coin problem
Divfuntion
- 算法分析实验 算法分析分治法 最近点对问题-Experimental analysis of algorithms analysis of algorithms divide and conquer the nearest point of the problem
Heapfunction
- 算法分析实验 算法分析变治法 堆排序-Experimental analysis of algorithms analysis of algorithms change conquer Heap Sort
fenzhi
- 正好在写用分治法求众数问题实验报告，写好了，让大家看下-Just writing to use divide and conquer the problem seeking plural experimental report, written, and let everyone Kanxia
suanfa
- 编程实现最大子段和问题的求解（分别采用分治法和动态规划法求解）。-Programming the largest sub-segment and the problem solving (respectively divide and conquer and dynamic programming method to solve).
Ajax_Lucene
- 《征服Ajax+Lucene构建搜索引擎》一书的光盘源代码。-" Conquer Ajax+ Lucene to build search engine," a book, CD-ROM source code.
RSA
- RSA算法加密与解密，MFC精美的添加SKinMagic皮肤的可视化界面，采用了分治法处理大整数取模问题-RSA algorithm for encryption and decryption, MFC delicate skin to add SKinMagic visual interface, using divide and conquer the problem to handle large integers modulo
Einstein
- 爱因斯坦传。一个伟大的科学家的生平。他用傲人的智慧和对科学严谨的态度征服了我们。希望此篇传记对您有所帮助。-Einstein pass. A great scientist' s life. He impressive wisdom and rigorous approach to science to conquer us. Biography Cipian you want to help.
qi_pan
- 用C++语言编写的残缺棋盘问题的分治法源代码，很完整，可直接编译运行。-Using C++ language problems and incomplete chessboard divide and conquer the source code, it is complete, can be directly compiled to run.
ClosestPt
- 采用分治算法找距离最近的两点，点数按输入给定，随机产生。能达到1000000个点。-use divid and conquer method to find the nearest points.
ConquerServerSource
- 征服服务端源代码 什么版本自己去研究,不过可以肯定是2.0以上版本的外国源代码-Conquest of what version of server-side source code for their own to study, but you can certainly be 2.0 or above versions of the foreign source code
co
- ramdan yahe and my love
canqueqipanwenti
- 残缺棋盘（defective chessboard）是一个有2k×2k个方格的棋盘，其中恰有一个方格残缺。图1给出k≤2时各种可能的残缺棋盘，其中残缺的方格用阴影表示。注意当k=0时，仅存在一种可能的残缺棋盘。事实上，对于任意k，恰好存在22k种不同的残缺棋盘。用分而治之方法可以很好地解决残缺棋盘问题。-Incomplete board (defective chessboard) is a 2k × 2k a chessboard squares, of which there is exac