搜索资源列表
POINT
- 用分治法找一个平面内的最接近点对。时间复杂度为O（nlogn）.-Using a divide and conquer to find the closest point of the plane pair. Time complexity is O (nlogn)
resueltas
- Java examples for dinamic programming, divide and conquer, greedy algorithms and backtracking.
Strassen
- 實現 Strassen s algorithm，用JAVA寫的，可以正常在 windows 執行。(divide and conquer) -Implement Strassen s algorithm
Arithmetic
- 用JAVA完成的0-1背包算法，一共用了四种算法，包括贪心，分治，动态规划，回溯。把工程导入ECLIPSE下就可以了。-JAVA finished 0-1 with a knapsack algorithm, a share of the four algorithms, including greedy, divide and conquer, dynamic programming, backtracking. To work on it under into ECLIPSE.
Itemtype.datEditor
- A program to automatically edit the Itemtype.dat file in Conquer so that you can see the rare items on the ground.
MinDistance_PointPair
- 用java实现的平面上最近点对的查找，包括蛮力法和分治法的实现。-Java implementation of the plane with the nearest point on the search, including the brute force method and the divide and conquer implementation.
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
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
Divide-and-Conquer-maxmin
- 分治策略 maxmin算法 求数组A[1...n]最大最小元素-Divide and Conquer maxmin
NearestPoint
- 算法分析与设计经典问题，用分治法求最近点对，并与蛮力法做对比-Classical algorithm analysis and design problems with the divide and conquer method for the last point, and compared with the brute force method to do
src
- 棋盘覆盖问题，算法分治算法的应用，java完成-Board cover problem, divide and conquer algorithm algorithm application, java complete
test1
- 分治法实现大整数乘法，其实应该用数组来保存大整数的，再考虑如何去完善这个程序。但分治算法的核心思想已经尽在其中了。-Divide and conquer method for large integer multiplication
Myframe.class
- 棋盘覆盖（有界面效果）,分治算法，界面还行-Board cover (interface effect), divide and conquer algorithm, the interface line
ChessBoard
- 大学期间的棋盘覆盖算法，采用分治策略，拥有图形界面。-University during the chessboard covering algorithm using a divide-and-conquer strategy, has a graphical interface.
testfi
- 合并排序，是java实现的。算法思想是递归和分治。-Merge sort java implementation. The algorithm the thinking is recursive divide-and-conquer.
Qipan
- 特殊方格必位于4个较小子棋盘之一中,其余3个子棋盘无特殊方格 用分治法解决棋盘覆盖问题算法接单明了。-Special grid must be located in one of the four smaller sub-chessboard, the remaining three sub-chessboard squares divide-and-conquer method to solve the chessboard coverage problem algorithm orders
Majority
- 众数问题。使用分治思想处理。对于给定的由n 个自然数组成的多重集S，编程计算S 的众数及其重数。-Public a few problems. Deal with the idea of divide-and-conquer. Calculated for a given n natural numbers multiset S, programming S plural of multiplicity.
IntegerMultiply
- 算法分析与设计 用递归分治算法解决大整数乘积问题（java源码）-Algorithm Analysis and Design Recursive divide and conquer algorithm to solve the problem of large integer multiplication. (Java source code)
java
- 用的分治法的思想,凸包顶点正好可以构成循环,感觉比较新颖,就是不断顺时针旋转,按照书上那个公式不断找出左边的点和顶点,不断存入到数组中,最后的输出刚好是顺时针的输出,创建了好几个数组,其中还有一个三维数组,用法比较特殊,无意间想到的-Ideological divide and conquer, the convex hull of the vertices can just constitute a cycle, feeling relatively new, is constantly r
grid
- 分治算法的直观应用，有GUI。即在8*8的格子中放一块障碍，求一种分配方案使得能用相同的直角方块（共3块成L字形）铺满整个方格。-Divide and conquer algorithm intuitive applications, there GUI. Ie 8* 8 grid put an obstacle, seeking an allocation scheme makes possible the same rectangular box (a total of three L-sh