搜索资源列表
defectBoardQ
- 算法分析经典的残缺棋盘问题 使用分治法求解。-Algorithm analysis and incomplete chessboard problem with the classic divide and conquer method.
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.
algorithm2
- 最大子段和/三种方法/c++语言/(内有报告) 蛮力法，动态规划法，分治法。 可比较时间，随机输入数据...... -The largest sub-segment and/three methods/c++ language/(within report) brute force method, dynamic programming, divide and conquer. Comparable time, the random input data ......
ESC-1_0
- CVPR2010文献：An Efficient Divide-and-Conquer Cascade for Nonlinear Object Detection的源代码-CVPR 2010 paper An Efficient Divide-and-Conquer Cascade for Nonlinear Object Detection source code.
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
openredalert-r462-src.tar
- 红警的linux版源码：命令与征服。可编译，data 文件需另外下载-The linux version of Red Alert Source: Command & Conquer. Can be compiled, data files downloaded separately
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.
Quick-sort
- Quicksort sorts by employing a divide and conquer strategy to divide a list into two sub-lists. The steps are: Pick an element, called a pivot, from the list. Reorder the list so that all elements with values less than the pivot come before the
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
C-Sharp-MaxSubsequenceSum
- An implementation of the Max Sub-sequence sum algorithm using divide and conquer. Includes driver program. Perfect for students. -An implementation of the Max Sub-sequence sum algorithm using divide and conquer. Includes driver program. Perfect for
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
Finding_Maximum
- Finding Maximum Contiguous Subsequence Sum using divide-and-conquer approach-Given a sequence Q of n numbers (positive and negative), the maximum subsequence of Q is the contiguous subsequence that has the maximum sum among all contiguous subsequ
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
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
divide
- divide and conquer to find maximum subarray and index