搜索资源列表
Mergesort
- 归并排序是建立在归并操作上的一种有效的排序算法。该算法是采用分治法（Divide and Conquer）的一个非常典型的应用。 -Merge sort merge operation is based on an efficient sorting algorithm. This method used divide and conquer (Divide and Conquer) a very typical applications.
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.
project2
- 用c语言做分治法之循环赛日程表，由于水平有限，我不知道错在哪里？请指教！-With the c language to divide and conquer the round-robin schedule, due to limited, I do not know wrong? Please advise!
qq
- 分治法网球循环赛日程安排，课程设计希望有用-Divide and conquer tennis round robin scheduling, curriculum design, hope helpful
Itemtype.datEditor
- A program to automatically edit the Itemtype.dat file in Conquer so that you can see the rare items on the ground.
CompactDDNS
- DynDns updater for Pocket PC and Windows Mobile Includes Vnc Server exe
Algorithm_Analysis_and_Design_of_recursive_and_div
- 算法分析设计之递归与分治法Algorithm Analysis and Design of recursive and divide and conquer-Algorithm Analysis and Design of recursive and divide and conquer Algorithm Analysis and Design of recursive and divide and conquer
src
- Notice: This very old code, made when I first learned to program. However, it still works for all current DMaps. This program reads a DMap file (From Conquer Online) and stores it into a 2d boolean array as coords[x][y]. The DMap class then prov
src
- A simple Java based Proxy (with some features such as dynamic packet creation) for Conquer Online. This works with the newest Conquer Online version (unless they make any packet offset changes, which should be easily fixable). Works with priva
main
- A simple loader for the game Conquer online, that adds proxy redirection, as well as a few other anti-botjail edits. The code is written in C++, compiled with MinGW.
voronoi
- Voronoi图的分治算法，达到O（nlogn）的时间复杂度。-Voronoi diagram of the divide and conquer algorithm to achieve O (nlogn) time complexity.
fenzhifa
- 用c++实现分治法算法的最近点对问题（在VS2008平台上）-Using c++ implementation of divide and conquer algorithm for the nearest point of the problem (in VS2008 platform)
fenzhi
- 算法，用c++实现分治法算法的众数问题（在VS2008平台上）-Algorithm, using c++ implementation of divide and conquer algorithm mode problem (in VS2008 platform)
DEM
- 目前三角网是进行精细地形表达最好和最常用的方法，因此本文讨论利用三角网法来建立露天矿的精细DEM模型。由于露天矿复杂特殊的地形特征，在建模过程中应充分考虑相应的约束条件，否则会出现台阶被削平等现象。构建不规则三角网的方法可分为分而治之算法、逐点插入算法和三角网生长算法。各种算法各具优缺点，结合矿区的实际情况，本文采用一次性约束三角网生成算法，经过空间数据提取、拓扑关系建立以及空间索引建立，最终建立起边界约束线以内的约束不规则三角网。-At present, triangulated irregu
Cpp1
- 该程序用格雷码来生成组合数序列,它比一般的方法要快-Divide and conquer method to construct the Gray code
ggzxl
- 分治法的基本思想是将一个规模为n的问题分解为k个规模较小的子问题，这些子问题互相独立且与原问题相同。递归地解这些子问题，然后将各个子问题的解合并得到原问题的解。-The basic idea of divide and conquer method is a problem of size n divided into k sub-problems of smaller, these sub-problems independent of each other and with the same
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
Strassen
- 矩阵乘法分治法实现。。C-Divide and conquer matrix multiplication implementation. . C++. . . . .
Select
- 第k小元素，分治法实现。。C-K-small elements, divide and conquer implementation. . C++. . . . .
a
- 分治策略—归并排序。（1）编写一个模板函数： template <typename T> MergeSort(T *a, int n) -Divide and conquer strategy- merge sort. (1) Write a template function: template <typename T> MergeSort (T* a, int n)