搜索资源列表
fenzhifa
- 用c++实现分治法算法的最近点对问题（在VS2008平台上）-Using c++ implementation of divide and conquer algorithm for the nearest point of the problem (in VS2008 platform)
Strassen
- 矩阵乘法分治法实现。。C-Divide and conquer matrix multiplication implementation. . C++. . . . .
Select
- 第k小元素，分治法实现。。C-K-small elements, divide and conquer implementation. . C++. . . . .
a
- 分治策略—归并排序。（1）编写一个模板函数： template <typename T> MergeSort(T *a, int n) -Divide and conquer strategy- merge sort. (1) Write a template function: template <typename T> MergeSort (T* a, int n)
fenzhisuanfa
- 分治算法的介绍 C++ ACM-Divide and Conquer Algorithm descr iption
quiksort
- 一个简单的快速排序程序，它是基于分治策略实现的。-A simple quick sort program, which is based on divide and conquer strategy to achieve.
Tromino1
- tromino问题，棋盘覆盖，算法中的分治法-tromino problems, board cover, divide and conquer 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.
polyMultiplyDaC
- Multiplication of two polynomial using divide and conquer method.
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.
Fib
- 算法分析基础——Fibonacci序列问题 分治法在数值问题中的应用——最近点对问题 减治法在组合问题中的应用——8枚硬币问题 变治法在排序问题中的应用——堆排序问题-The basis of algorithm analysis- Fibonacci sequence divide and conquer the problem of the numerical problems- the nearest point on the issue by governing law in
Pipeline-problem
- 使用C++语言实现了分治和递归的算法，有一定的帮助。-C++ language using a divide and conquer and recursive algorithms, have some help.
cPP
- 数据结构算法与应用，在简要回顾了基本的C++ 程序设计概念的基础上，全面系统地介绍了队列、堆栈、树、图等基本数据结构，以及贪婪算法、分而治之算法、分枝定界算法等多种算法设计方法，为数据结构与算法的继续学习和研究奠定了一个坚实的基础。更为可贵的是，本书不仅仅介绍了理论知识，还提供了50多个应用实例及600多道练习题。-Data structures algorithms and applications, in a brief review of basic C++ programming con
fenzhi
- 分治法源码，01背包问题，经典的01背包问题-Divide and conquer source, 01 knapsack problem