搜索资源列表
suanfa3
- 分治法的基本思想 借此交流，彼此沟通
dividemultiply
- 这是一个分治法应用的又一个例子,利用分治技术,做大整数乘法,尤其是几百位数以上的乘法,比一般的方法快很多,仅次于快速傅立叶变换.-This is a partition of the application also an example of the use of the partition, bigger integer multiplication, especially above the median of hundreds of multiplication, than the mu
Commonalgorithms
- 一些常用的算法设计方法和C++环境下的实现方法。主要包括：迭代法、穷举搜、索法、递推法、递归、回溯法、贪婪法、分治法 -Some commonly used algorithm design methods and C environments are implemented. These mainly include: iterative method, exhaustive search, rope method, recursive method, recursion, backtra
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
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
cpair
- 用分治法求平面两点的最短距离，main函数用随机数生成n个随机数，然后求他们的最短距离-Plane with the Method of the shortest distance between two points, main function uses the random number generator random number n, and then find the shortest distance between them
NearestPoint
- 使用分治法实现最近点对算法，图形化界面，可以通过鼠标点击生成点也可以随机生成，并计算得到最近点对-Divide and conquer method to achieve the closest point algorithm, graphical interface, can be generated by a mouse click can also be randomly generated, and calculated to the nearest point on
multiplication
- 分治法求大整数乘法，包含简易的分支思想的阐述及大整数乘法实现代码和报告-The method of the large integer multiplication
bignumber
- 分治法实现的大整数乘法。是学习分治算法策略的很好的范例。-Sub-rule method to achieve the large-integer multiplication. Is a good example of learning the strategy of divide and conquer algorithm.
algorithm
- 熟悉C/C++语言的集成开发环境；通过本实验加深对分治法、贪心算法的理解。掌握贪心算法、动态规划和回溯算法的概念和基本思想，分析并掌握"0-1"背包问题的三种算法，并分析其优缺点。-Master the greedy algorithm, the dynamic programming algorithm and back of the concept and basic thought, analysis and master "0-1" knapsack problem three algo
Algorithm-analysis-and-design
- 计算机实验室 内容： 1、分治法，maxmin算法 2、动态规划，矩阵连乘 3、贪心法， 1）背包问题，2）装载问题 4、回溯法，N皇后问题的循环结构算法和递归结构算法。-Computer laboratory content: 1, partition method, maxmin algorithm 2, the dynamic planning, LianCheng matrix 3, greedy method, 1) knapsack probl
quick_sort
- 快速排序,算法课后写的，写对其进行划分，然后采用分治法递归使用。-quick sort
gaijin-fenzhifa
- 此为对分治法大整数相乘的一个改进，能够给对刚开始学习算法的人一个了解的机会-This is an improved large integer multiplication of divide-and-conquer method to the beginning of the learning algorithm an understanding of the opportunity
QuickSort
- 用快速排序（分治法），对序列{23，13，49，6，31，19，28}进行升序排列，适用于初学者，算法设计与基础，写的很通俗易懂-Quick sort (divide and conquer), the sequence {23,13,49,6,31,19,28} in ascending order, suitable for beginners, algorithm design and basic, very easy to understand
合并排序的分治算法
- 在Visual C++里编写程序，用分治法完成随机输入数列的合并排序(The program is written in Visual C++, and the sorting and sorting of random input sequence are completed by divide and conquer method)