搜索资源列表
chessboard
- 用C++语言实现棋盘覆盖分治算法 在一个2k×2k 个方格组成的棋盘中，恰有一个方格与其它方格不同，称该方格为一特殊方格，且称该棋盘为一特殊棋盘。在棋盘覆盖问题中，要用4种不同形态的L型骨牌覆盖给定的特殊棋盘上除特殊方格以外的所有方格-C++ language with the board divided coverage of a 2k × 2k Algorithm in the composition of the board of squares, just a different box
fenzhisuanfa
- 分治算法的介绍 C++ ACM-Divide and Conquer Algorithm descr iption
Cplusone
- 数据结构分治策略的几个典型问题的解答，分类清晰-Per policy data structure answers some typical questions
BasisofComputerAlgorithm
- 针对算法分析这么课程中的分治算法、二分检索、回溯等经典算法题目的汇总-Algorithm analysis course for the partition of such a method, binary search, backtracking a summary of topics such as the classical algorithm
closepair
- 二位平面中求最近点对的问题，采用分治的方法，按照书本的算法实现-Two nearest points on the plane ask the question, the use of divide and conquer approach, in accordance with the books of the algorithm
guibingpaixu
- 基于分治思想的归并排序算法简单实现,使用C++编写.-Based on Divide and Conquer simple implementation of merge sorting algorithm, written using C++.
Algorithmdesign
- 递归与分治算法的设计 动态规划算法设计 贪心算法设计 -Recursive divide and conquer algorithm with dynamic programming algorithm designed greedy algorithm
Algorithm
- 数据结构，算法，包括动态规划、分治策略、回溯法。-Data structures, algorithms, including dynamic programming, divide and conquer, backtracking.
min_distance
- 本算法用于求一系列点集中距离最小的点对,利用分治，递归，大大减少计算量-This algorithm is used to find a point of focus from the minimum point, the use of divide and conquer, recursion, greatly reducing the computational
alogrithms-in-pku
- 北京大学 算法分析与复杂性理论国家级精品课程课件，非常值得一看。分治，贪心，动态规划，NP理论-Peking University, algorithm analysis and complexity theory national quality courseware, very worth seeing. Divide and conquer, greedy, dynamic programming, NP theory. . .
recursive-algorithm
- 用算法分析中递归与分治算法实现的，最长公共子序列算法，编程环境为vc-Analysis using the recursive algorithm and the divide and conquer algorithm, the programming environment for the vc++
Board
- 棋盘覆盖问题是分治算法的一个经典问题，这里用C++进行了实现，代码在C++Builder下运行通过。-Board cover problem is a classic divide and conquer algorithm problem, here were implemented in C++ code in C++ Builder to run through.
Pipeline-problem
- 使用C++语言实现了分治和递归的算法，有一定的帮助。-C++ language using a divide and conquer and recursive algorithms, have some help.
qsort
- 快速排序算法（分治策略） C++编写 调用递归-Fast sorting algorithms (divide and conquer strategy) C++ write
merge
- 用分治法进行归并分类，归并算法的分治思想使用辅助数组归并两个已分类的集合-failed to translate
CloseSTPair
- 分治算法，分离点对，计算最小距离，采用分而治之的策略，代码清新明了，易读性强-CloseSTPair: Complute the shortest distanse
Computer-algorithms
- 计算机常用的算法，有 算法概述 分治与递归 动态规划 贪心算法 回溯法 分限界法-Computer algorithm used have an overview of divide and conquer algorithm is recursive dynamic programming, greedy algorithms with backtracking points and bound
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
Study-Materials
- 关于程序设计的一些想法和思路，包括动态规划、回溯、分治等-Study Materials