搜索资源列表
fenzhisuanfa
- 分治算法的介绍 C++ ACM-Divide and Conquer Algorithm descr iption
the_beautiful_algorithm_of_C_and_VC
- C C++实现的一些著名的算法，包括贪心、分治-C++ realization of some famous algorithm, including greed, partition, etc
1
- 利用分治原理解决棋盘覆盖问题，利用深度搜索填充棋盘-Using the principle of partition board cover problem solving, the use of depth of search fill board
fenzhisuanfa
- 这是中国数学建模中编程交流上分治算法内容，里面提供了很多分治算法的例子-This is the exchange of mathematical modeling in the programming content on the divide and conquer algorithm, which provides many examples of divide and conquer algorithm
build-f
- 求解图形轮廓问题，利用分治算法减少时间复杂度。数据结构以链表为主-Graphic outline for solving the problem, using divide and conquer algorithm to reduce the time complexity. Data structures to the main list
Cplusone
- 数据结构分治策略的几个典型问题的解答，分类清晰-Per policy data structure answers some typical questions
guibing
- 这是一个基于分治策略算法的归并排序的程序，使用的语言是C-This is a strategy of divide and conquer algorithm based on merge sort, the use of the language is C++
BasisofComputerAlgorithm
- 针对算法分析这么课程中的分治算法、二分检索、回溯等经典算法题目的汇总-Algorithm analysis course for the partition of such a method, binary search, backtracking a summary of topics such as the classical algorithm
closepair
- 二位平面中求最近点对的问题，采用分治的方法，按照书本的算法实现-Two nearest points on the plane ask the question, the use of divide and conquer approach, in accordance with the books of the algorithm
Ten_Commonly_Algorithm_for_MATLAB
- 超过10种MATLAB常用算法：Floyd算法，动态规划,分治算法,概率算法,模拟退火算法,神经网络,搜索算法,贪婪算法,遗传算法,组合算法,-Over 10 types of commonly used MATLAB algorithms: Floyd algorithm, dynamic programming, divide and conquer algorithms, probabilistic algorithms, simulated annealing, neural netwo
guibingpaixu
- 基于分治思想的归并排序算法简单实现,使用C++编写.-Based on Divide and Conquer simple implementation of merge sorting algorithm, written using C++.
Algorithmdesign
- 递归与分治算法的设计 动态规划算法设计 贪心算法设计 -Recursive divide and conquer algorithm with dynamic programming algorithm designed greedy algorithm
6
- 设计程序利用分治策略求n个数的最大值和最小值。-Divide and conquer strategy design process using the number n find the maximum and minimum.
2
- 利用分治策略，在n个不同元素中找出第k个最小元素。-Using divide and conquer strategy, to find n different elements in the first k-smallest element.
algorithm-design
- ACM算法入门课件，很适合初学者，包括枚举，贪心，分治，搜索，动归，数论等得内容，很有参考价值-Introduction courseware ACM algorithm, it is suitable for beginners, including enumeration, greedy, divide and conquer, search, dynamic return, so get the contents of number theory, a good reference
computational-geometry(DengJunHui)
- 邓俊辉老师的计算几何，相信大家都不陌生，里面讲解了很多经典算法，比如分治算法，平面扫描算法，随机算法...相信对研究图形处理方面的人绝对会非常有用-Deng Junhui computational geometry teacher, I believe that everyone is familiar with, which explains a lot of classical algorithms such as divide and conquer algorithm, plane s
Algorithm
- 数据结构，算法，包括动态规划、分治策略、回溯法。-Data structures, algorithms, including dynamic programming, divide and conquer, backtracking.
The_Square_Game
- 实现java的方块着色，分治算法经典例子， 用图形化界面，说明清楚，欢迎下载哦~-Java coloring to achieve the box, a classic example of divide and conquer algorithm, with the graphical interface, clear instructions, please download the oh
2.2
- 2.2、线性时间选择（分治策略） 实验数据：input.txt（共100个数据） ——要求找出序列中最小的元素 将最小元素输出到output.txt文件中 -2.2, linear time selection (divide and conquer strategy) experimental data: input.txt (a total of 100 data)- the minimum required to identify sequence elements in
Chessboard
- 本程序生成一个n*n的棋盘，n是2的幂，用一个分治算法，用一个L型条块去覆盖除一个指定方块外的所有方格。 如n=2，则有4个方格，其中3个能被一个L型覆盖，N=4，有16个方格，其中15个方格被5个L条型覆盖。 结果中每一个L条形用3对坐标表示-This procedure generates a n* n chessboard, n is a power of 2, with a divide and conquer algorithm, with an L-slice to a sp