搜索资源列表
CompQsortToMsort
- 分治算法与快速排序时间比较,根据运行时间比较其算法的优越性。-compare quicksort to mergesort
divide-and-conquer-algorithm
- 《算法引论中》解决分治算法问题以及轮廓问题，讨论算法，适合初学者-" Introduction to Algorithms in the" divide and conquer algorithm to solve the problem and outline problems, discuss algorithms, suitable for beginners
QuickSort
- 快速排序,采用C++的分治思想。是十大排序算法中效率最高的一个-QuickSort,in C++
The-divide-and-conquer-algorithm
- 分治算法求解两个有序数组的中位数，求解过程比较详细-Divide and conquer algorithm for solving two ordered arrays median
chapter-2
- 算法设计与分析的 第2章 递归与分治策略.pdf-Design and Analysis of Algorithms Chapter 2 Recursion and divide and conquer strategy. Pdf
fenzhisuanfa
- 这是数学建模中常用的分治算法的源码，matlab专用，做数学建模的同学可以下载-It is commonly used in mathematical modeling of the source partition algorithm, matlab specific, do mathematical modeling students can download
MergeSort
- 归并排序。二路归并排序的分治算法，用VC++6.0实现。-Merge sort. 2 merge sort of partition algorithm, using vc++ 6.0.
qsort
- 分治递归实现的快速排序算法 时间复杂度nlogn -Divide and conquer recursive quicksort algorithm time complexity nlogn
classical-algorithms
- 许多经典算法问题的源代码,包括数据结构,分治,回溯,动态规划,图论,贪心等等,包括了C,C++和Java代码,已分成文件夹整理好.-Many classical algorithms of the source code, including data structures, divide and conquer, backtracking, dynamic programming, graph theory, greed, etc., including C, C++ and Java cod
int_divide_SA13006029
- 整数因子问题的C语言源代码 计算机算法设计与分析中的题目 递归与分治算法-C language source code for a computer algorithm design and analysis topics recursive divide and conquer algorithm with integer factor issues
solution-for-hannuota
- 汉诺塔解法代码,可以解决任意层数的汉诺塔问题，主要方法是递归与分治的思想-Tower of Hanoi solution code, you can solve any number of layers of the Tower of Hanoi problem, the main method is recursive with the idea of partition
chessboard-coverage-of-c-code
- 利用分治策略对棋盘覆盖问题进行求解，用c语言来实现。-Using divide and conquer strategy chessboard coverage of c code
C-yuyan
- 基于C语言的一些算法分析及实现，主要有动态规划，分治，搜索算法等-Some algorithm analysis and implementation of C language based mainly on dynamic programming, divide and conquer, the search algorithm
The-change-of-the-elements
- 这是关于元素交换分治算法的代码，希望对大家学习有帮助-the change of the elements
suanfa
- 利用分治算法和蛮力算法求最近点对的长度问题-Use divide and conquer algorithm and a brute-force algorithm for the nearest point on the length of the problem
convex_hull
- 凸包问题的算法实现，graham算法实现，分治算法以及暴力算法，有简单图形界面-Convex Hull algorithm problem, graham algorithm, divide and conquer algorithms and violence algorithm, a simple graphical interface
cPP
- 关于二部图、线段数、树状数组、树的分治的一些POJ题目的解答-About two figure, the number of segments, Fenwick tree, the tree of divide and conquer some POJ topic answers
evacuation
- 这是一个好的建模学习资料,赶快下载吧, 数学建模十大算法 ( 包含:蒙特卡罗算法、数据拟合、参数估计、 插值等数据处理算法、线性规划、整数规划、多元规划、二次规划等规划类问题、 图论算法、动态规划、回溯搜索、分治算法、分支定界等计算机算法、 最优化理论的三大非经典算法：模拟退火法、神经网-very goog
algorithm
- 以设计策略为主线，循序渐进地介绍了经典算法设计（包括分治、动态规划、贪心、回溯、迭代改进等算法）、NF完全理论、非精确型算法设计〔包括近似算法、参数化算法，随机算法），以及现代智能优化方法．强调算法思维与编程实践并重，注重运用算法技术解决实际工程问题。-In order to design strategy as the main line, gradual introduction of the classic algorithm design (including the partition
Sort
- 基于分治策略的实现快速排序算法和归并算法。-Quicksort algorithm and merging algorithm based on divide and conquer strategy