搜索资源列表
分而治之算法
- 分而治之算法描述，是文本形式的喔！-divide and conquer algorithm descr iption is the text!
POINT
- 用分治法找一个平面内的最接近点对。时间复杂度为O（nlogn）.-Using a divide and conquer to find the closest point of the plane pair. Time complexity is O (nlogn)
ajax
- 征服ajax源码，包含基本的框架介绍，各自框架下的例子介绍。-Conquer ajax source that contains the basic framework introduced under the framework of their respective examples.
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
ajax2.0
- ajax 经典书籍 征服ajaxweb2.0-ajax classic books ajaxweb2.0 conquer
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.
VisualBasicNETIDidntKnowYouCouldDoThatVBL.pdf
- Visual Basic .NET! I Didn t Know You Could Do That... will help you conquer the .NET learning curve quickly as you make the transition to Microsoft s new programming paradigm. Inside you ll find loads of ideas and advice that will teach you
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
java
- 征服Ajax - Web20开发技术详解试读版 -Conquest Ajax- Web20 Detailed probation version development techniques to conquer Ajax- Web20 Developer Edition Detailed probation
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
ajax-Web2.0-code
- 《征服ajax Web2.0开发技术详解》光盘源码-《Detailed development of technology to conquer ajax Web2.0》 CD source
src
- 棋盘覆盖问题，算法分治算法的应用，java完成-Board cover problem, divide and conquer algorithm algorithm application, java complete
upload
- the patch of conquer online (real co ) version 5072
test1
- 分治法实现大整数乘法，其实应该用数组来保存大整数的，再考虑如何去完善这个程序。但分治算法的核心思想已经尽在其中了。-Divide and conquer method for large integer multiplication
Myframe.class
- 棋盘覆盖（有界面效果）,分治算法，界面还行-Board cover (interface effect), divide and conquer algorithm, the interface line