搜索资源列表
qsort
- 快速排序算法（分治策略） C++编写 调用递归-Fast sorting algorithms (divide and conquer strategy) C++ write
Strass
- Strassen矩阵乘法 分治法 矩阵乘法 时间复杂度O(n^2.81)-Strassen matrix multiplication, divide and conquer matrix multiplication time complexity O (n ^ 2.81)
Cover-board-
- 分治算法中的棋盘问题 使用MFC编程 棋盘大小1~64*64-Divide and conquer algorithm chessboard problem with MFC programming board size from 1 to 64* 64
computer_classical_arithmetic
- 该文件主要为分治策略、概率算法、回溯算法、枚举法、模拟退火算法、排序算法、搜索算法、贪心算法、遗传算法、蚁群算法的介绍及实现方式-The document mainly divide and conquer, probabilistic algorithms, backtracking algorithm, enumeration method, simulated annealing algorithm, sorting algorithm, search algorithm, greedy
Computer-algorithms
- 计算机常用的算法，有 算法概述 分治与递归 动态规划 贪心算法 回溯法 分限界法-Computer algorithm used have an overview of divide and conquer algorithm is recursive dynamic programming, greedy algorithms with backtracking points and bound
MaxOfSubSegSum
- vc求最大子串和问题 分别采用分治法和蛮力法很好的解决了这个问题-vc find the largest substring and problems, and were used to divide and conquer a good brute force method to solve this problem
devide
- 分治法实验报告 非常实用，有详细的代码，是一个WORLD里面的-Divide and conquer divide and conquer method lab report experiment report divide and conquer divide and conquer method experiment lab report report
dazhengshuxiangcheng
- 利用分治法实现大整数相乘，大整数可以是很长的位数-Using divide and conquer method to achieve large integers, big integers, the number of bits can be very long
Recursion-and-divided-.ppt
- 这是关于分治与递归算法的课件，文章详细的讲解了这两周算法的设计要点。-This is about divide and conquer and recursive algorithm courseware, the article explained in detail the design elements of the algorithm for two weeks.
fenzhifa
- 分治算法的一些源码，可以供大家学习一下，介绍分支算法的逻辑 -Divide and conquer algorithm for some of the source, you can look for them to learn
suanfa2
- 分支限界法、分治法、动态规划法常见代码，素数环问题、背包问题、抄写书稿问题。-Branch and bound method, divide and conquer, dynamic programming method common code, prime ring problem, knapsack problem, the problem copying the manuscr ipt.
6
- First, the longest common subsequence problem two largest sub-segment and problems (divide and conquer algorithm) Third, the largest sub-segment and the problem (dynamic programming algorithm)-First, the longest common subsequence problem two larges
Board-covering-algorithm
- 棋盘覆盖算法，分治法，使用Microsoft Visual Studio 2010编写，控制台程序-Board covering algorithm, divide and conquer method, using Microsoft Visual Studio 2010 written in console application
MaxSum
- 用蛮力法、分治法和减治法求最大子段和问题并比较运行时间。-With the brute force method, divide and conquer method for the treatment and reduce the largest sub-segment and the issues and compare the running time.
ClosestPoints
- 分治法和蛮力法求最近对问题及其时间复杂度比较-Divide and conquer method and the brute force method for the recent problems,and comparing the running time.
fzfksfl
- 分治法快速排序的c++代码，实现平台为visual studio 2008-Divide and conquer quicksort c++ code, the platform for Visual Studio 2008
NearestPoint
- 使用分治法实现最近点对算法，图形化界面，可以通过鼠标点击生成点也可以随机生成，并计算得到最近点对-Divide and conquer method to achieve the closest point algorithm, graphical interface, can be generated by a mouse click can also be randomly generated, and calculated to the nearest point on
algorithms
- 附件是邓建明老师上的算法课的详细课件，设计算法设计与分析的各个方面，如分治法，贪心算法，平摊分析等，希望对大家有帮助-Attachment algorithm Jian-ming teacher lesson courseware, and all aspects of the design algorithm design and analysis, such as divide and conquer method, greedy algorithms, amortized analysis
dbbz
- 自己实现的敌兵布阵的源代码，HDOJ1066题，数据结构使用了线段树和树状数组，算法策略使用了分治策略。-Own implementation of the enemy soldiers ended their source code, HDOJ1066 question, data structures using the segment tree and the tree array, the algorithm strategy of divide and conquer strategy
bignumber
- 分治法实现的大整数乘法。是学习分治算法策略的很好的范例。-Sub-rule method to achieve the large-integer multiplication. Is a good example of learning the strategy of divide and conquer algorithm.