搜索资源列表
孟庆洋 分治
- 是著名的骑士巡游问题的改进，采用了分治策略，同样也是我的个人作品，向往大家给予批评指正-Cleveland is the famous parade of improvement, adopted a divide and conquer strategy, but it's also my personal work, and yearning for everyone criticized correction
CQuadDissect
- Delaunay三角网作为一种主要的DTM表尔法，具有权其广泛的用途。经过二十多年来的研究，它的生成算法巳趋于成熟。本文简要介绍了Delaunay三角网的定又及其特性，在简单回顾和评价了分割—归并法，逐点插入法，三角冈生长法等三类主沈算法的基础上，提出了一个融以上算法优点于一体，兼顾空间与时间性能的合成算法。经测试，一般情况下它的运算速度远快于逐点插入法，与分割—归并法相当，较好的情况下快于分割—归并法。-Delaunay Triangulation as a major DTM Fall ta
利用分治策略实现自然合并排序算法程序;
- 利用分治策略实现自然合并排序算法程序 方便地解决排序的问题-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
mergesort11
- 二分搜索是运用分治策略的典型例子。二分搜索方法充分利用了元素间的次序关系，采用分治策略，可在最坏情况下用O(logn)的时间完成搜索任务。-two hours search is to use the divide and conquer strategy is a typical example. Two-search method full use of the elements in the order, using the divide and conquer strategy, in
zhengfu
- 征服模似器Ｃ语言代码，下载的-conquer for it with C language code and download the hurry!
divide-and-conquer
- 组合优化与算法分析 分治算法（divide and conquer）的描述和分析-divide and conquer
divide-and-conquer-algorithm
- 《算法引论中》解决分治算法问题以及轮廓问题，讨论算法，适合初学者-" Introduction to Algorithms in the" divide and conquer algorithm to solve the problem and outline problems, discuss algorithms, suitable for beginners
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
Divide-and-Conquer-EKF-SLAM-in-O(n)
- divide and conquer SLAM
divide-and-conquer-algorithm
- 分治算法的基本思想是将一个规模为N的问题分解为K个规模较小的子问题，这些子问题相互独立且与原问题性质相同。求出子问题的解，就可得到原问题的解。-The basic idea of divide and conquer algorithm is a scale problem is decomposed into N K a smaller sub-problems, these sub-problems are independent and original problems of the s
divide-and-conquer-algorithm
- 详细讲解了算法学习中的分治算法的原理，并附有详细的例题讲解和伪码-Explained in detail the algorithm of learning the principle of divide and conquer algorithm, with a detailed example to explain and pseudo-code
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)