搜索资源列表
acm_algorithm
- 细说常用算法之分治算法，doc文档，举了四个适用于分治算法的例子：找出伪币、金块问题、矩阵算法、金块问题。都有详细的算法思想说明。-Elaborate algorithms most of the Divide and Conquer Algorithm, doc documents, cites four sub-rule algorithm applied to an example: to find counterfeit coins, gold bullion issues, matri
DataStructureAlgorithm
- 数据结构和算法，非常经典，讲的很详细！第一部分 基础知识 第一章 C++程序设计 第二章 程序性能 第二部分 数据结构 第三章 数据描述 第四章 数组和矩阵 第五章 堆栈 第六章 队列 第七章 跳表和散列 第八章 二叉树和其他树 第九章 优先队列 第十章 竞赛树 第十一章 搜索树 第十二章 图 第三部分 算法设计方法 第十三章 贪婪算法 第十四章 分而治之算法 第十五章 动态规划 第十六章 回
DataStructuresandAlgorithmAnalysis
- 全面系统地介绍了队列、堆栈、树、图等基本数据结构，以及贪婪算法、分而治之算法、分枝定界算法等多种算法设计方法。-A comprehensive and systematic introduction to the queue, stack, tree, map and other basic data structures, as well as greedy algorithms, divide and conquer algorithms, branch and bound algorith
devide_conquer
- 分治法解最近点对问题：首先输入点的个数，然后输入点的坐标，输出先是根据x的坐标对点进行排序，然后输出最近点对的距离。-Divide and conquer solution of the nearest point of the problem: First, the number of input points, and then enter the coordinates of points, the output first, according to the coordinates of
Detest1
- C/C++ implementation of a Divide-and-Conquer algorithm
ini
- conquer items to have fun in the game
dbPoint.c
- C语言实现，分治法求平面中任意个点的最近点对和最近距离。-C language implements, find out the shortest point pair and the shortest length between arbitrary points in a plane, with divide and conquer method.
petroline
- 输油管道问题 计算机算法设计分析 分治法算法实现题-Computer Algorithm Design and Analysis of pipeline issues divide and conquer algorithm question
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).