搜索资源列表
Qsort
- 快速排序（分治法实现） 快速排序（分治法实现）-Quick Sort (sub-rule method) quick sort (sub-rule method)
ex1_cityoutline_squ
- 用分治法实现城市轮廓问题，开发工具为eclipse,jdk 1.6-Treatment with sub-urban profile issues, development tools for the eclipse, jdk 1.6
Strassen
- 利用C++实现strassen矩阵乘法，即采用七次乘法的分治法。-The use of C++ realization of Strassen matrix multiplication, namely multiplication seven sub-rule method.
ChesssBoard
- 分治法棋盘覆盖chess,算法设计的例子-Coverage of sub-rule method chessboard chess, algorithm design examples
MaxSum
- 计算机算法分析，最大字段和的几个求法，采用直接法，分治法，动态优化法进行求解的程序。-Analysis of computer algorithms, the largest number of fields and method, using the direct method, sub-rule method, dynamic optimization method for solving procedures.
fenzhi
- 这是一个利用分治法求最短回路的算法，希望对大家有帮助撒-This is a law governing the use of sub-algorithm for the shortest loop, in the hope that everyone has to help spread
text
- 设B是一个n×n棋盘，n=2k,(k=1,2,3,…)。用分治法设计一个算法，使得：用若干个L型条块可以覆盖住B的除一个特殊方格外的所有方格。其中，一个L型条块可以覆盖3个方格。且任意两个L型条块不能重叠覆盖棋盘。-。。
The_design_of_computer_algorithms
- 全书从算法设计和算法分析的基本概念和方法入手，系统介绍了算法设计方法与分析技巧。全书分为3个部分：第一部分介绍算法的基本概念、算法的数学基础以及算法复杂度分析；第二部分针对排序问题和图的问题，讨论各种已有的算法，并介绍常用的算法设计方法包括分治法、贪心法、动态规划法、回溯法和分支限界法，并介绍了计算的复杂性以及NP完全问题；第三部分讲述并行计算模型和并行算法设计技术。书中每章后面都附有一定数量的习题，帮助读者理解和掌握书中的内容。-Book from the algorithm design a
ChessMulch
- 棋盘覆盖问题，用分治法算法求解的一个例子。-Cover board with sub-algorithm treatment of a case in point.
Mul-of-big-Int
- 引用分治法实现两个位数相同的大整数的乘法运算-Act reference divided large integer multiplication
CompareSort
- 采用分治法，比较快速排序和归并排序的时间复杂度，即计算每个排序过程所花的时间并输出。-The use of sub-rule law, compare quick sort and merge sort time complexity, that is calculated for each sort process and output the time spent.
CSort
- 用C++6.0编写，采用分治法求解快速排序和归并排序所花的时间并输出，能够具体地让大家明白时间复杂度这一抽象的概念-Using C++6.0 development, the use of sub-rule method to sort quick sort and merge the time spent and output, specifically so that everyone can understand the time complexity of this abstract c
nearestpoint
- 求最近点对的算法，使用分治法求解最近点对问题-For the nearest point of the algorithm, the use of sub-rule method to solve the problem nearest point
ChessBoard
- 经典的棋盘覆盖程序，实现MFC界面，用分治法实现-Coverage of the classic board procedures, the realization of MFC interface, with sub-rule method
Cover_board
- 棋盘覆盖问题,,算法中分治法的一个好例子，代码不到100行啊-Chessboard coverage, distributed algorithm for treatment of a good example of the code less than 100 lines ah
CSDNdatastructure
- 分治法求大数乘法的问题 等等一些算法分析-datastructure
devide_conquer
- 分治法解最近点对问题：首先输入点的个数，然后输入点的坐标，输出先是根据x的坐标对点进行排序，然后输出最近点对的距离。-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
closestpoints
- 最短距离点对算法分治法实现 以及暴力算法的对比-Closest Distance Point Pairs Divide and Conque Algorithm
NearestPoints
- 分别利用分治法及穷举法求解最近点对问题，输出查找结果及比较次数。-Use, respectively, sub-rule method and brute-force method for solving the nearest point of the problem, the output and compare the number of search results.
Nearest
- 分别利用分治法及穷举法求解最近点对问题，输出查找结果及比较次数。-Use, respectively, sub-rule method and brute-force method for solving the nearest point of the problem, the output and compare the number of search results.