搜索资源列表
defectBoardQ
- 算法分析经典的残缺棋盘问题 使用分治法求解。-Algorithm analysis and incomplete chessboard problem with the classic divide and conquer method.
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
Algorithm
- 数据结构，算法，包括动态规划、分治策略、回溯法。-Data structures, algorithms, including dynamic programming, divide and conquer, backtracking.
polyMultiplyDaC
- Multiplication of two polynomial using divide and conquer method.
round
- 单循环比赛日程安排算法实现。利用分治法实现2的n次幂个运动员日程安排，利用轮转法实现n个运动员日程安排。-Round robin scheduling algorithm competition. Using divide and conquer method to achieve two of the n th power athlete schedule, the use of Round-Robin schedule to achieve n-athletes.
123.cpp
- 求最大值和最小值 用分治法来求 c++环境-Find the maximum and minimum use of divide and conquer method to find c++ environment
min_distance
- 本算法用于求一系列点集中距离最小的点对,利用分治，递归，大大减少计算量-This algorithm is used to find a point of focus from the minimum point, the use of divide and conquer, recursion, greatly reducing the computational
alogrithms-in-pku
- 北京大学 算法分析与复杂性理论国家级精品课程课件，非常值得一看。分治，贪心，动态规划，NP理论-Peking University, algorithm analysis and complexity theory national quality courseware, very worth seeing. Divide and conquer, greedy, dynamic programming, NP theory. . .
recursive-algorithm
- 用算法分析中递归与分治算法实现的，最长公共子序列算法，编程环境为vc-Analysis using the recursive algorithm and the divide and conquer algorithm, the programming environment for the vc++
the-nearest-point
- 算法分析实验中，用递归与分治算法实现的最接近点对实验，编程环境为vc-Algorithm analysis experiments, using a recursive divide and conquer algorithm with the nearest point of the experiment, vc++ programming environment
one-day-FS
- 一天征服傅里叶变换，对傅里叶变换有比较通俗的解释-One day conquer the Fourier transform, Fourier transform of a relatively popular explanation
Max-and-Min
- 运用递归与分治策略同时找到一组数据的最大最小数,算法复杂度为n*logn-The use of recursive divide and conquer strategy with the same time find a set of minimum and maximum number of data, the algorithm complexity is n* logn
Board
- 棋盘覆盖问题是分治算法的一个经典问题，这里用C++进行了实现，代码在C++Builder下运行通过。-Board cover problem is a classic divide and conquer algorithm problem, here were implemented in C++ code in C++ Builder to run through.
Fib
- 算法分析基础——Fibonacci序列问题 分治法在数值问题中的应用——最近点对问题 减治法在组合问题中的应用——8枚硬币问题 变治法在排序问题中的应用——堆排序问题-The basis of algorithm analysis- Fibonacci sequence divide and conquer the problem of the numerical problems- the nearest point on the issue by governing law in
fft
- 一天征服傅里叶变换,超简单的描述，让没有基础的同学都能看的明白，适合还处在似懂非懂的状态的同志们。-One day conquer the Fourier transform, super simple descr iption, so there is no basis to understand the students can look for is still in the state of half-comprehended comrades.
eight-queens
- 分治法求解八皇后问题，一个简单的分治法应用算法。-Divide and conquer method to solve the eight queens problem, a simple application of divide and conquer algorithm.
Pipeline-problem
- 使用C++语言实现了分治和递归的算法，有一定的帮助。-C++ language using a divide and conquer and recursive algorithms, have some help.
cPP
- 数据结构算法与应用，在简要回顾了基本的C++ 程序设计概念的基础上，全面系统地介绍了队列、堆栈、树、图等基本数据结构，以及贪婪算法、分而治之算法、分枝定界算法等多种算法设计方法，为数据结构与算法的继续学习和研究奠定了一个坚实的基础。更为可贵的是，本书不仅仅介绍了理论知识，还提供了50多个应用实例及600多道练习题。-Data structures algorithms and applications, in a brief review of basic C++ programming con
fenzhi
- 分治法源码，01背包问题，经典的01背包问题-Divide and conquer source, 01 knapsack problem
snippet
- 简单的分治方法查找数字的例子，算法课程的作业。-Simple divide and conquer method to find the number of examples, algorithms course work.