-
-
[
Visual C++ (VC++)]
DataStructuresandAlgorithmAnalysis.rar
A comprehensive and systematic introduction to the queue, stack, tree, map and other basic data structures, as well as greedy algorithms, divide and conquer algorithms, branch and bound algorithm for a variety of algorithm design methods.
-
-
[
Visual C++ (VC++)]
devide_conquer.rar
Divide and conquer solution of the nearest point of the problem: First, the number of input points, and then enter the coordinates of points, the output first, according to the coordinates of the points x sort, and then output the nearest point of the ...
-
[
C/C++]
dbPoint.c.gz
C language implements, find out the shortest point pair and the shortest length between arbitrary points in a plane, with divide and conquer method.
-
-
[
Visual C++ (VC++)]
Commonalgorithms.zip
Some commonly used algorithm design methods and C environments are implemented. These mainly include: iterative method, exhaustive search, rope method, recursive method, recursion, backtracking, greedy method, divide and conquer
Category:
Algorithm Upload User:
zsxinyu888 Size:
28K
-
-
-
[
Visual C++ (VC++)]
fenshu.rar
Analysis of algorithms written in the sub-problem, the use of divide and conquer to solve the classic problem
-
[
C/C++]
suanfa.rar
... , for beginners service, easy to understand, common algorithm design methods: numerical algorithms: iterative method, the recursive method, interpolation method, etc. non-numerical algorithms: divide and conquer, greedy method, backtracking law.