搜索资源列表
NearestPoint
- 最近点对问题是许多算法书籍必有得一个要探讨的问题，本人基于王晓军的《算法设计与分析》实现了分治法及传统法的图形化演示程序，大家可以看到两者的算法性能的比较。-The nearest point of the problem is that many books there must be a method to explore the question, I based Wang Xiaojun' s " Algorithm Design and Analysis of"
CommonAlgorithmDesign
- 常用的算法设计方法集合，主要有迭代法、穷举搜索法、递推法、贪婪法、回溯法、分治法、动态规划法-Algorithm commonly used method of collection, mainly iterative, exhaustive search methods, recursion, greedy method, backtracking, divide and conquer, dynamic programming
search
- 用分治法对n个不同的排好序的整数进行查找，使得T[i]=i。-With the Method of the n different rows to find a good sequence of integers so that T [i] = i.
sort
- 快速排序，求解第k个最小元素，用分治法求解-sort，Solving the first k-smallest element
Hanoi
- Hanoi，用分治法解决汉诺塔问题，vc6.0编译运行通过-Hanoi, Tower of Hanoi with the Method to solve the problem, vc6.0 compile and run through
AlgorithmCode
- C++版本的各类算法源代码，包括动态规划法、分治法、贪心法、回溯法、分支限界法、概率算法-C++ source code version of the various algorithms, including dynamic programming, divide and conquer, greedy method, backtracking, branch and bound method, probability algorithm
feangzhi
- 本文介绍了分治法的基本思想和基本步骤，通过实例讨论了利用分治策略设计算法的途径。 目录 简介 分治法的基本思想 分治法的适用条件 分治法的基本步骤 分治法的复杂性分析 分治法的几种变形 分治法的实例分析 -This article describes the basic idea of sub-rule method and the basic steps, through an example de
JZXC
- 大矩阵相乘，使用了分治法优化，能够快速准备计算两个大矩阵相乘，使用了Stranssen矩阵算法-Strassen
xunhuansaiqxf
- 算法课程设计 分治法解决循环赛日程表 源代码+word报告+答辩PPT-Curriculum design of divide and conquer algorithm to solve a round robin schedule report+ source code+ word reply PPT
Mergesort
- 归并排序是建立在归并操作上的一种有效的排序算法。该算法是采用分治法（Divide and Conquer）的一个非常典型的应用。 -Merge sort merge operation is based on an efficient sorting algorithm. This method used divide and conquer (Divide and Conquer) a very typical applications.
project2
- 用c语言做分治法之循环赛日程表，由于水平有限，我不知道错在哪里？请指教！-With the c language to divide and conquer the round-robin schedule, due to limited, I do not know wrong? Please advise!
Algorithm_Analysis_and_Design_of_recursive_and_div
- 算法分析设计之递归与分治法Algorithm Analysis and Design of recursive and divide and conquer-Algorithm Analysis and Design of recursive and divide and conquer Algorithm Analysis and Design of recursive and divide and conquer
fenzhifa
- 用c++实现分治法算法的最近点对问题（在VS2008平台上）-Using c++ implementation of divide and conquer algorithm for the nearest point of the problem (in VS2008 platform)
fenzhi
- 算法，用c++实现分治法算法的众数问题（在VS2008平台上）-Algorithm, using c++ implementation of divide and conquer algorithm mode problem (in VS2008 platform)
ggzxl
- 分治法的基本思想是将一个规模为n的问题分解为k个规模较小的子问题，这些子问题互相独立且与原问题相同。递归地解这些子问题，然后将各个子问题的解合并得到原问题的解。-The basic idea of divide and conquer method is a problem of size n divided into k sub-problems of smaller, these sub-problems independent of each other and with the same
Strassen
- 矩阵乘法分治法实现。。C-Divide and conquer matrix multiplication implementation. . C++. . . . .
Select
- 第k小元素，分治法实现。。C-K-small elements, divide and conquer implementation. . C++. . . . .
ChessBoard
- 分治法解决棋盘覆盖问题，采用MFC界面实现棋盘覆盖问题的直观描述-Divide and conquer method to solve the coverage problem board, using MFC interface to achieve a visual descr iption of the board covering problem
Convex_hull_problem
- 凸包问题( 分治法与穷举法+测试数据 )-Convex hull problem (divide and conquer and the exhaustive method+ test data)
MinDistance_PointPair
- 用java实现的平面上最近点对的查找，包括蛮力法和分治法的实现。-Java implementation of the plane with the nearest point on the search, including the brute force method and the divide and conquer implementation.