搜索资源列表
exponential
- four different large exponential calculating algorithms: Simple algorithm (Brute force algorithm) David and conquer algorithm. Divide more and conquer algorithm. Binary exponent algorithm.
include
- 1)随机输入平面上n个点的集合； 2)使用分治策略编制计算机程序求出这n个点的极大点。 3)编程实现2维极大点问题的求解，且在程序中体现分治策略。程序能处理任意的n个点。 -1) a collection of n points on a random input plane 2) using divide and conquer strategy computer program to calculate the maximum point of the n point.
algorithm
- 图包问题的多种解法，python实现，蛮力、gramham、分治-Many kinds of solutions, the python package diagram, brute force, Gramham, divide and conquer
My_L
- L型骨牌（棋盘覆盖问题） -算法分析之分治策略 算法分析与设计 课程中分治策略的典型例子，采用MFC文档编程可视化实现算法； 能够手动进行对棋盘的颜色填充，并能显示棋盘中的填充数值。 由于这是课程作业，时间紧而赶制的，封装性可能比较差。 我用的版本是C++6.0的老版本，静态链接库，其中的exe可以直接运行。-L-type domino (chessboard coverage problem) - divide and conquer strategy algorithm algorith
Decrease-and-Conquer
- 该文章主要研究了依靠减治技术的各搜索算法，从基本搜索到对基本搜索改进，最后探讨了启发式的搜索，逐步深入，从而加深对搜索和减治法的理解-The paper studies the reduction treatment technologies rely on various search algorithms, basic search to search for basic improvements, and finally discuss the heuristic search, the
gui-bing-pai-xu
- 归并排序是建立在归并操作上的一种有效的排序算法,该算法是采用分治法（Divide and Conquer）的一个非常典型的应用。将已有序的子序列合并，得到完全有序的序列；即先使每个子序列有序，再使子序列段间有序。若将两个有序表合并成一个有序表，称为二路归并。-Merge sort is established in the merge operation a effective sorting algorithm. The algorithm is using the divide and co
fenzhifazuijnidiandui
- 分治法的应用，分治法求最近点对源码，编译无措，算法基础实验-The application of the method, divide and conquer method for the nearest point on the source code, compile flawless, algorithm based on the experiment
DAZHENGSHU-
- 分治法大正数运算支持1000位以内运算，不过自己可以很方便地改长度-Divide and conquer positive operation within 1000 bit support operations, but you can easily change the length of
1130
- 用C++写的小程序，用递归与分治法实现循环赛日常问题-Small program written in C++ using recursive divide and conquer the round robin day-to-day problems
Mergesorting
- 归并排序算法是建立在归并操作上的一种有效的排序算法。该算法是采用分治法的一个非常典型的应用。-Merge sorting algorithm is based on an efficient merge operation sorting algorithm. The algorithm is a very typical application using the divide and conquer method.
MergeSort
- c++的归并排序算法,改算法是用c++编写的，其中用到了递归的思想，和分治法的思想，方便大家参考学习。-c++ mergesort algorithm, which is written by c++, which uses a recursive thinking, and thinking divide and conquer, to facilitate reference study.
main
- 杭电ACM上1007问题的已经通过的源码，主要采用分治法来解决这个问题-Hangzhou Electric ACM 1007 on the issue of the source code has been adopted, mainly uses divide and conquer to solve the problem
MaxSubSum
- 用三种方法解决最大子序列和问题，分别是基本方法，分治算法和动态规划算法，算法复杂度不断提高-Three methods were used to solve sequence and the biggest problem, respectively is the basic method and divide and conquer algorithm and dynamic programming algorithm, the complexity of the algorithm is i
tennis1
- 北邮算法设计课程网球循环赛代码,使用分治算法，可以直接提交-BUPT tennis round robin algorithm design course code, use the divide and conquer algorithm, can be submitted directly
quick-sort
- 利用分治法实现一组数据的快速排序，使其排序时间缩短，并采用c语言编程-Using divide and conquer method to achieve quick sort a set of data, the sorting time is shortened, and the use of C language programming
FEZZ
- 分而治之的算法分 而治之的算法分而治之的算法-Divide and conquer algorithm
fenzhi
- 凸包求解算法。 实现基于枚举方法的凸包求解算法 实现基于Graham-Scan的凸包求解算法 实现基于分治思想的凸包求解算法 对比三种凸包求解算法 -Convex hull algorithm. Based on Convex Hull algorithm enumeration method Based on Graham-Scan convex hull algorithm Based on Divide and Conquer convex hull alg
algorithm
- matlab算法详细分析，包括应用广泛的分治算法、灰色预测、时间序列、模拟退火、蚁群算法。-matlab algorithm detailed analysis, including the widely used divide and conquer algorithm, gray forecasting, time series, simulated annealing, ant colony algorithm.
BOSS-add1.1
- 征服1.6 2.0 3.0 3.5 BOSS添加器 -conquer 1.6 2.0 3.0 3.5 BOSS ADD
cq_action
- 此文件是征服游戏数据库的cq_action解说-This file is to conquer the game cq_action comment