搜索资源列表
chesscover
- 此程序是关于算法设计与分析中的棋盘覆盖问题，采用分治策略实现的。-on algorithm design and analysis covering the chessboard, using the divide and conquer strategy to achieve.
ClosestNodePairs
- 这是最接近点对问题，分别使用了分治算法和穷举法求解最接近点对。-it is the closest point of the problem, namely the use of a divide-and-conquer method and exhaustive closest point right.
ajax-luncene
- 此源码为征服ajax+Lucene构建搜索引擎源码,包括很多事例,大家可以借鉴。-to conquer this source Construction ajax Lucene search engine source code, including many examples, we can learn from.
netwar-source-0.5.0
- NetWar是一个实时策略游戏，类似于Command & Conquer, Starcraft, 和Total Annihilation。这个游戏只提供了多人模式，LAN上支持最多12人同时游戏。是用Java开发的。-NetWar is a real-time strategy game, similar to the Command
yakun
- 归并排序,算法分析与设计第二章分治法思想的归并排序算法实现,用C++写的.-merge sorting algorithm analysis and design of the second chapter ideological divide-and-conquer method of merging ranking algorithm, C writes.
kuaisu
- 快速排序,算法分析与设计第二章分治法思想的快速排序算法实现.-quick sort, algorithm analysis and design of the second chapter ideological divide-and-conquer method of quick sort algorithm.
Bigintmutiply
- 大整数乘法的分治法源码，在JDK1.51中运行-large integer multiplication of the divide-and-conquer method source code, to run in JDK1.51
MergeSort2
- 二路合并排序算法，使用分治策略,时间复杂度O(nlog2n), 需要和待排记录等数量的辅助空间，是一种稳定的排序算法-two-way merge sorting algorithm, the use of divide-and-conquer strategy, the time complexity O (nlog2n) Pai and the need to record the number of auxiliary space, is a stable Sort Algorithm
5.3
- 在数组中寻找最大元素.该算法采用分治算法.-in finding the greatest array elements. The algorithm used divide-and-conquer.
AJAXkaifa
- 征服ajax＋lucene书籍各章节源代码ajax部分-conquer ajax + lucene book chapters part of the source code ajax
zhengfuLucene
- 征服ajax＋lucene书籍各章节源代码lucene部分-conquer ajax + lucene book chapters part of the source code lucene
ChessboardCover
- Chessboard Cover,On a chessboard，only one square is different, called specific.Use the Divide-and-Conquer methods to solve the Chessboard Cover Problem.-Chessboard Cover, On a chessboard. only one square is different, specific.Use called the Divide -
VoronoiDAC
- 采用分治法解决生成Voronoi图的问题，采用用户交互式输入点及动态显示运行结果的方式，非常直观-using divide-and-conquer method to solve the Voronoi diagram generation. using interactive user input and dynamic display of the results of the operation, a very intuitive
分而治之算法
- 分而治之算法描述，是文本形式的喔！-divide and conquer algorithm descr iption is the text!
StampAssignment
- 一个以邮票分配方案为例的演示分治法算法的小程序-a stamp distribution program as an example of the divide-and-conquer demonstration algorithm small program
打天下php+mysql招聘求职源代码
- 打天下php+mysql招聘求职源代码-conquer the world php mysql job recruitment source code
SQL_Server的公司进销存管理的实例2
- 征服-conquer January 1
将军互联号码生成器
- 西木头的东西喜欢弄一些让人不喜欢的特性，比如同一序列号安装出来的东西无法联机啦。没办法我只好写了这个东西。。。针对《命令与征服-将军》,太简单了,不知道能不能通过审核-West wood things like get some people do not like characteristics, such as the installation of the same sequence of the things it can not be on-line. No way I had to
searchmin
- 根据分治算法策略，来实现对一个系列中最小数的查找．-under the divide-and-conquer strategy to achieve a series of the smallest number of search.
divide and conquer
- 这是一个分治法应用和递归的完美体现，它根据输入的数字在屏幕上打出美丽的图案。-this is a separate rule and the application of recursive the perfect embodiment of its import figures on the screen making beautiful designs.