搜索资源列表
strassen-web
- 算法课中的矩阵乘法，strassen问题求出几个矩阵的乘积，用divide and conquer思想-Implement the Strassen algorithm algorithm for MatrixMultiplication problem in your favourite language, and compare the performance with grade-school method.
merge-and-count
- 完成sort and count算法，是算法分析当中devide and conquer中的一道题-The attached file Q5.txt contains 100,000 integers between 1 and 100,000 (each row has a single integer), the order of these integers is random and no integer is repeated. 1. Write a program to
zuoye5
- 二分检索（分治法）给定递增整数序列L，其大小为n，要求使用二分查找法查找任意元素的位置k(序列中第几个)。-Binary search (divide and conquer) given increasing sequence of integers L, and its size is n, and requires the use of binary search method to find the location of any element k (sequence of sever
zuoye6
- 矩阵乘法（分治法） 设A 和 B 是两个n * n阶矩阵，求它们两的乘积矩阵C。-Matrix multiplication (divide and conquer) Let A and B be two n* n order matrix, find the product of their two matrix C.
juzheng
- 矩阵乘法（分治法） 设A 和 B 是两个n * n阶矩阵，求它们两的乘积矩阵C。-Matrix multiplication (divide and conquer) Let A and B be two n* n order matrix, find the product of their two matrix C.
zuoye7
- 第k小元素（分治法） 给定一个线性序列集，要求求出其中指定的第K小的数的值和位置.如给定n个元素和一个整数i，1≤i≤n，输出这n个元素中第i小元素的值及其位置；-First k small element (divide and conquer) Given a set of linear sequence, where the specified requirements determined the K value and the small number of locations, s
divide-and--conquer
- 实现大整数相乘，时间复杂度n(logn),c++源码-Achieve a large integer multiplication, time complexity n (logn), c++ source
maxfieldsum
- 用分治法解决最大子段和问题,利用了递归和合并，使问题能够简易求解-Solve the problem with the largest sub-segment and divide and conquer method, the use of recursion and merge so that the problem can be solved simple
algorithm
- 关于常用的几种算法介绍1、单源最短路径；2、递归与分治；3、贪心算法；4、动态规划；5、回溯法；6、分支限界法-On several commonly used algorithm introduced a single-source shortest path 2, recursion and divide and conquer 3, the greedy algorithm 4, dynamic programming 5, backtracking 6, branch and
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
nearestpoint
- 随机在二维平面上生成一千个点，再利用分治算法计算这一千个点中的最近点对，并返回这两个点的距离和坐标-Randomly generated on a two-dimensional plane a thousand points, and then use divide and conquer algorithm to calculate these thousand points of the nearest point on, and return from, and coordinate t
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
Visitor
- minimax to conquer your fear and take a brief look at the world of alpha gamma and beta and get going to be
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下可能出现的游戏卡顿、缓慢等问题。如果你在其他系统下使用此补丁出现问题