搜索资源列表
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. . .
1
- 用分治法求第k小元素 输入:程序从标准输入读入数据,第一行是一个整数n (1=<n<=100000)表示元素的个数,接下来的n行中每行有一个整数。最后一行是k,就是我们要找的第k小元素。 -Method used divide and conquer a small element of k-input: program read from standard input data, the first line is an integer n (1 = <n<
Demo
- 用netbeans写的swing程序,写了非递归求两整数最大公因子、分治法求大整数乘法、动态规划求最长公共子串,集合划分问题。 -Netbeans swing with written procedures, write a non recursive find the greatest common factor of two integers, divide and conquer seek large integer multiplication, dynamic programming
fenzhifa
- 分治法的思想是将一个难以直接解决的大问题分割成一些规模较小的几个相似的问题来解决,分治法的求解过程是将整个问题分解成若干个小问题后分而治之,如果分解得到的子问题相对来说还太大,则可反复使用分治策略将这些子问题分成更小的同类型子问题,直至产生出方便求解的子问题,必要时逐步合并这些子问题的解,从而得到问题的解。分治法的求解通常会用到递归,通常会说分治法是一种找大规模问题与小规模问题关系的方法,是递归设计方法的一种具体策略。分治法的基本步骤在每一层递归上都有三个步骤: ① 分解:将原来的规模相对较
dongtaiguihua
- 动态规划的基本思想是把求解的问题分成许多阶段或 多个子问题,然后按照顺序求解各个子问题。前一子问题的解为后一子问题的求解提供了有用的信息。在求解任一子问题时,列出各种可能的局部解,通过决策保留那些可能达到最优的局部解,舍弃其他的局部解。依次解决各个子问题,最后一个子问题的解就是原问题的解。动态规划算法与分治法类似,但是不同的是,在使用动态规划求解问题时得到的各个子问题往往不是相互独立的。由于动态规划算法解决问题往往有重叠子问题的特点,因此为了减少重复计算,不管该子问题以后是否被用到,只要它被
max-and-min
- 算法与数据结构,分治算法求最大值最小值,也是一次作业-Algorithms and data structures, divide and conquer algorithm
closestPairPoints
- 使用分治法求大量点中的最近点对.使用MFC做用户界面.10^6个点时间大约为0.1妙-Get the closest pair of points from points clouds by divide and conquer method. UI by MFC. It costs about 0.1 second computing from 1,000,000 points
recursive-algorithm
- 用算法分析中递归与分治算法实现的,最长公共子序列算法,编程环境为vc-Analysis using the recursive algorithm and the divide and conquer algorithm, the programming environment for the vc++
the-nearest-point
- 算法分析实验中,用递归与分治算法实现的最接近点对实验,编程环境为vc-Algorithm analysis experiments, using a recursive divide and conquer algorithm with the nearest point of the experiment, vc++ programming environment
tomato
- 番茄工作法,类似分治法的工作方式有效提高工作效率-Tomato working method, similar to the divide and conquer method to effectively improve the efficiency of work
one-day-FS
- 一天征服傅里叶变换,对傅里叶变换有比较通俗的解释-One day conquer the Fourier transform, Fourier transform of a relatively popular explanation
Max-and-Min
- 运用递归与分治策略同时找到一组数据的最大最小数,算法复杂度为n*logn-The use of recursive divide and conquer strategy with the same time find a set of minimum and maximum number of data, the algorithm complexity is n* logn
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
java
- 征服Ajax - Web20开发技术详解试读版 -Conquest Ajax- Web20 Detailed probation version development techniques to conquer Ajax- Web20 Developer Edition Detailed probation
fft
- 一天征服傅里叶变换,超简单的描述,让没有基础的同学都能看的明白,适合还处在似懂非懂的状态的同志们。-One day conquer the Fourier transform, super simple descr iption, so there is no basis to understand the students can look for is still in the state of half-comprehended comrades.
round-robin-schedule
- 分治法 循环赛日程表 设计队伍之间的比赛安排-Divide and conquer design team round robin schedule arrangements between the competition
zfpk
- 征服免费PK外挂美化版,专门用于征服..本人试过了,还可以-Conquer the free plug-ized PK
eight-queens
- 分治法求解八皇后问题,一个简单的分治法应用算法。-Divide and conquer method to solve the eight queens problem, a simple application of divide and conquer algorithm.