搜索资源列表
利用分治策略实现自然合并排序算法程序;
- 利用分治策略实现自然合并排序算法程序 方便地解决排序的问题-use the divide and conquer strategy to achieve natural merger procedures to facilitate sorting algorithm to solve the problem of sorting
快排
- 快速排序 算法的基本思想： 快速排序的基本思想是基于分治策略的。对于输入的子序列ap..ar，如果规模足够小则直接进行排序，否则分三步处理 -fast algorithm basic idea : Quick Sort The basic idea is based on the divide and conquer strategy. For input sequences ap .. ar, if the scale is small enough for dire
Windows程序设计_vc++
- Windows几乎不需要介绍。然而人们很容易忘记Windows给办公室和家庭桌上型计算机所带来的重大改变。Windows在其早期曾经走过一段坎坷的道路，征服桌上型计算机市场的前途一度相当渺茫。-Windows almost no introduction. However, it is very easy to forget the Windows desktop office and the family computer from a major change. Early in its W
chesscover
- 此程序是关于算法设计与分析中的棋盘覆盖问题，采用分治策略实现的。-on algorithm design and analysis covering the chessboard, using the divide and conquer strategy to achieve.
yakun
- 归并排序,算法分析与设计第二章分治法思想的归并排序算法实现,用C++写的.-merge sorting algorithm analysis and design of the second chapter ideological divide-and-conquer method of merging ranking algorithm, C writes.
kuaisu
- 快速排序,算法分析与设计第二章分治法思想的快速排序算法实现.-quick sort, algorithm analysis and design of the second chapter ideological divide-and-conquer method of quick sort algorithm.
5.3
- 在数组中寻找最大元素.该算法采用分治算法.-in finding the greatest array elements. The algorithm used divide-and-conquer.
dye-Divide-and-conquer
- Divide: the problem into a number of subproblems that are themselves smaller instances of the same type of problem. Conquer: Recursively solving these subproblems. If the subproblems are small enough, solve them straightforward. Combine:
ClosetPairs
- 本算法使用分治法求解最近点对问题。事先用O(nlogn)时间对x坐标进行排序，使得所有的点是按x坐标从小到大排好序的（x坐标相同时y坐标小的排前），然后取下标小于n/2属于左边的点集PL，取下标大于n/2属于右边的点集PR，即用O(1)时间就可以将规模为n的问题分解为两个规模为n/2的、同类型的子问题。分割完毕之后就可以采用分治法，分别求出PL和PR中的最近点对，最终通过递归实现。-This algorithm uses divide and conquer to solve the probl
Luncher
- Co luncher for conquer privite server
msdar
- Conquer online Source Code Patch 5165
The-divide-and-conquer-algorithm
- 分治算法求解两个有序数组的中位数，求解过程比较详细-Divide and conquer algorithm for solving two ordered arrays median
[Mini-book]-conquer-c-pointer
- 【迷你书】征服c指针,一本非常好的c语言书，值得-[Mini-book] conquer c pointer, a very good c language books worth a look
Algorithm2-Divide and Conquer
- 用C++分治法对数组进行排序、查找（使用windows下的visual C++）,分治法是一种有效的排序方法。(Sorting and finding the array by the method of divide_and_conquer in C++, which is an useful method in many cases.)
分治法
- 分治法的详细说明，比较简单易懂，哈哈哈哈(A detailed descr iption of the divide and conquer method)
Divide and conquer methed
- 利用分治法来解决找出n枚硬币中所含有的一枚假币问题(To solve the counterfeit coin problem in n coins by means of divide and conquer method)
ExodusBinaries
- 4267 version conquer with cq_action cq_task code
cq
- cq_sql database conquer landers database
LordsRoad Fixed By Amjad V 2
- 征服新版模拟器源代码，V2版,能正常编译(Conquer the new version of the simulator source code, V2)
Conquer(mysql)
- 征服5506版，带数据库，正常编译，能开区。(Conquer the 5506 edition, with database, normal compilation, can open area.)