搜索资源列表
closest_pair
- 分治法思想,求最邻近点对,考虑将所给的n个点的集合S分成2个子集S1和S2,每个子集中约有n/2个点,然后在每个子集中递归地求其最接近的点对-Divide and conquer ideas, find the nearest point to consider given the set S of n points into two subsets S1 and S2, each subset of about n/2 points, and then recursively find its
ProjectX_V3.2
- Projectx conquer source for a-Projectx conquer source for all
voronoi
- Voronoi Diagram算法实现主要运用分治法和凸包的方法来实现。 分治法: 1) 该问题的规模缩小到一定的程度就可以容易地解决 2) 该问题可以分解为若干个规模较小的相同问题,即该问题具有最优子结构性质。 3) 利用该问题分解出的子问题的解可以合并为该问题的解; 4) 该问题所分解出的各个子问题是相互独立的,即子问题之间不包含公共的子问题。 -Voronoi Diagram algorithm is mainly using the method of pa
game-launcher-SC
- Alright, this is my first tutorial and I wanted to show people how to make there own launcher that simply opens Conquer.exe and closes the program. Yes it s very simple and takes like, 2 seconds to do something this easy but I am contributing.
fs101
- 命令与征服2泰伯利亚之日地图编辑器,支持火线风暴-Command & Conquer Tiberian 2 map editor,Command & Conquer Tiberian 2 map editor
PowerCO
- great source of conquer-this is just a great work for evry 1
algorith4
- 用分治法解决最近点对问题,就是将一个问题分解两个子问题,然后递归处理子问题,然后合并求出最短距离-Solve the problem closest point using divide and conquer method is to decompose a problem of two sub-problems, and then recursively processing sub-problems, and then find the shortest distance merge
chapter-2
- 算法设计与分析的 第2章 递归与分治策略.pdf-Design and Analysis of Algorithms Chapter 2 Recursion and divide and conquer strategy. Pdf
GamePatcher
- VB源代码编写实现的命令与征服系列图形补丁程序,如果游戏当前在运行中,可能无法进行操作!游戏运行前请将本补丁程序放置在游戏(泰伯利亚之日、红色警戒2、尤里的复仇)根目录下!,如果依旧出现此提示信息,可能是你的游戏版本不匹配. 补丁说明:本补丁程序采用VisualBasic6.0程序编写,喜欢VB源码的可参考,补丁专用于命令与征服系列游戏(泰伯利亚之日、红色警戒2、红色警戒2:尤里的复仇)在Vista/Windows7下可能出现的游戏卡顿、缓慢等问题。如果你在其他系统下使用此补丁出现问题
qsort
- 分治递归实现的快速排序算法 时间复杂度nlogn -Divide and conquer recursive quicksort algorithm time complexity nlogn
classical-algorithms
- 许多经典算法问题的源代码,包括数据结构,分治,回溯,动态规划,图论,贪心等等,包括了C,C++和Java代码,已分成文件夹整理好.-Many classical algorithms of the source code, including data structures, divide and conquer, backtracking, dynamic programming, graph theory, greed, etc., including C, C++ and Java cod
MergeSort
- 归并排序,采用分治法的一个典型应用。主要步骤可以简单的描述为:【从小到大排序】 第一步:把数组分成左右两个数组,然后递归直至左右数组只包含单个元素【最底层】; 第二步:从单个元素开始,归并数组,使得数值小的在上一层数组的左侧,数值大的在上一层数组的右侧,然后递归,直至到原数组【最顶层】。-Merge sort, using a typical application of divide and conquer method. The main steps can be simply de
int_divide_SA13006029
- 整数因子问题的C语言源代码 计算机算法设计与分析中的题目 递归与分治算法-C language source code for a computer algorithm design and analysis topics recursive divide and conquer algorithm with integer factor issues
chessboard-coverage-of-c-code
- 利用分治策略对棋盘覆盖问题进行求解,用c语言来实现。-Using divide and conquer strategy chessboard coverage of c code
Beep-function-to-play-music-with
- 演奏乐曲《小星星》《茉莉花》《找朋友》《上学歌》《一分钱》《征服》《沧海一声笑》《童话》《同桌的你》《小熊和洋娃娃》-Playing music "Little Star" "Jasmine", "find friends", "school song", "penny" "conquer" "Laughter In The Sea" "fairy tale", "same table for you," "Winnie and dolls"
main6
- C语言编写的命令行程序,通过蛮力法、动态规划、分治法求最大字段和,并进行算法效率比较。-C language command-line program, through brute force method, dynamic programming, divide and conquer method for maximum field and, and compare efficiency of the algorithm.
sort
- 各种排序算法大全c++版 直接顺序排序、冒泡排序,选择,快排,希尔排序,堆排序,归并排序、筛选法调整堆、堆排序、一次归并、一趟归并法排序、归并排序的非递归算法、归并排序的递归算法、将两个已排序的子序列归并。-Various sorting algorithms Daquan c++ version of the direct order sort, bubble sort, select, quick row, shell sort, heap sort, merge sort, filter
C-yuyan
- 基于C语言的一些算法分析及实现,主要有动态规划,分治,搜索算法等-Some algorithm analysis and implementation of C language based mainly on dynamic programming, divide and conquer, the search algorithm
cuosp_4267
- A Conquer 4267 private server codes
Emulator
- Conquer 5017 emulator