搜索资源列表
cplusgp
- 《征服C&C++企业软件开发核心技术》CD-" Conquer C & C++ enterprise software development core technology" CD
feangzhi
- 本文介绍了分治法的基本思想和基本步骤，通过实例讨论了利用分治策略设计算法的途径。 目录 简介 分治法的基本思想 分治法的适用条件 分治法的基本步骤 分治法的复杂性分析 分治法的几种变形 分治法的实例分析 -This article describes the basic idea of sub-rule method and the basic steps, through an example de
1
- 考虑8 x 8的国际象棋棋盘上某个位置的一匹马，它是否可能只走63步，正好走过除起点以外的其他63个位置各一次？如果有这样的一种走法，则称所走的这条路线为一匹马思维周游路线。试设计一个分治算法找出一条马的周游路线。-Consider 8 x 8 chess board on a horse to a location, it may only take 63 steps, just walk away than from the other 63 positions each time? If
xunhuansaiqxf
- 算法课程设计 分治法解决循环赛日程表 源代码+word报告+答辩PPT-Curriculum design of divide and conquer algorithm to solve a round robin schedule report+ source code+ word reply PPT
Quicksort
- 基于分治算法的快速排序。编程工具vc++6.0.时间复杂度O（nlogn）-Divide and Conquer Algorithm Quicksort
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.
project2
- 用c语言做分治法之循环赛日程表，由于水平有限，我不知道错在哪里？请指教！-With the c language to divide and conquer the round-robin schedule, due to limited, I do not know wrong? Please advise!
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)
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
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)