搜索资源列表
snippet
- 简单的分治方法查找数字的例子，算法课程的作业。-Simple divide and conquer method to find the number of examples, algorithms course work.
qsort
- 快速排序算法（分治策略） C++编写 调用递归-Fast sorting algorithms (divide and conquer strategy) C++ write
BetaSourc
- Conquer onlien source server
conquer-furior-transform-one-day
- 傅里叶变换，采用通俗易懂的语言介绍了傅里叶变换的原理-furior transform
chess_cover
- 分治法解决棋盘覆盖问题。使用C#，可自定义棋盘大小。每个棋盘用若干L型块覆盖-Divide and conquer method to solve the coverage problem board. Using C#, customizable board size. Each board covered with a number of L-block
chessboard
- 采用分治算法完成棋盘覆盖问题的求解，用C#完成了棋盘覆盖的界面显示。-Using divide and conquer algorithm to complete the board covering problem solving, finished with C# interface display board covered.
Strass
- Strassen矩阵乘法 分治法 矩阵乘法 时间复杂度O(n^2.81)-Strassen matrix multiplication, divide and conquer matrix multiplication time complexity O (n ^ 2.81)
ChessBoard
- 用分治法，一个棋盘，提供一个特殊方格用黑色填充，其余用L型方块填满。-Using divide and conquer, a board, a special box filled with black, the other filled with the L-type box.
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.