搜索资源列表
孟庆洋 分治
- 是著名的骑士巡游问题的改进，采用了分治策略，同样也是我的个人作品，向往大家给予批评指正-Cleveland is the famous parade of improvement, adopted a divide and conquer strategy, but it's also my personal work, and yearning for everyone criticized correction
mergesort11
- 二分搜索是运用分治策略的典型例子。二分搜索方法充分利用了元素间的次序关系，采用分治策略，可在最坏情况下用O(logn)的时间完成搜索任务。-two hours search is to use the divide and conquer strategy is a typical example. Two-search method full use of the elements in the order, using the divide and conquer strategy, in
ClosestNodePairs
- 这是最接近点对问题，分别使用了分治算法和穷举法求解最接近点对。-it is the closest point of the problem, namely the use of a divide-and-conquer method and exhaustive closest point right.
MergeSort2
- 二路合并排序算法，使用分治策略,时间复杂度O(nlog2n), 需要和待排记录等数量的辅助空间，是一种稳定的排序算法-two-way merge sorting algorithm, the use of divide-and-conquer strategy, the time complexity O (nlog2n) Pai and the need to record the number of auxiliary space, is a stable Sort Algorithm
StampAssignment
- 一个以邮票分配方案为例的演示分治法算法的小程序-a stamp distribution program as an example of the divide-and-conquer demonstration algorithm small program
divide and conquer
- 这是一个分治法应用和递归的完美体现，它根据输入的数字在屏幕上打出美丽的图案。-this is a separate rule and the application of recursive the perfect embodiment of its import figures on the screen making beautiful designs.
bc_mfc
- 使用Binomial Cofficient的演算法,並以Divide-and-Conquer以及Dynamic Programming的方式來實作,並以比例尺來做比較-use of the algorithms, and Divide - and-Conquer and Dynamic Programming is the way to make and do more to Scale
post-office-(fenzhisuanfa)
- post office 邮局选址问题 分治算法，能运行，我已经调好的-post office post office location problem Divide and Conquer Algorithm, can run, I have a good tune
dazhengshu
- 本人上传的是用分治法实现的大整数算法，采用的是数组形式。-I uploaded is to use divide and conquer to achieve a large integer arithmetic, using the array form.
1
- 分治算法解士兵站队问题，ACM大学生程序设计题。-Divide and conquer algorithm for solving the soldiers stand in question, ACM Collegiate Programming problem.
quick_so
- quicccck sort using divide n conquer-quicccck sort using divide n conquer...
houka
- Kings^OF^Binary Source File Conquer Online
Convex_hull_problem
- 凸包问题( 分治法与穷举法+测试数据 )-Convex hull problem (divide and conquer and the exhaustive method+ test data)
Divide-and-conquer-algorithm
- 分治算法是基于多分枝递归的一种算法设计模式。分治算法递归地把一个大问题分解为多个类型相同的子问题，直到这些子问题足够的简单能被直接解决。最后把这些子问题的解结合起来就能得到原始问题的解。-Divide and conquer algorithm is based on a multi-branch recursive algorithm design pattern. Divide and conquer algorithm recursively to a large problem into
recursive-divide-and-conquer
- 算法设计课件(第二章递归与分治)，主要讲述递归与分治-Algorithm courseware design (Chapter II recursive divide and conquer), focuses on the recursive divide and conquer
conquer-and-divide-algorithm
- 本章描述了讲解了分治算法的基本思想和设计过程以及原理-Explain the basic idea and design process as well as the principle of divide and conquer algorithm described in this chapter
divide-and-conquer-algorithm
- 利用分治策略求解时，所需时间取决于分解后子问题的个数、子问题的规模大小等因素，而二分法，由于其划分的简单和均匀的特点，是经常采用的一种有效的方法，例如二分法检索。-When solving using the divide and conquer strategy, the time required depends on the number of decomposed sub-problems, the size of sub-problems and other factors, but
divide-and-conquer
- 组合优化与算法分析 分治算法（divide and conquer）的描述和分析-divide and conquer
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
divide-and-conquer-algorithm
- 分治算法的基本思想是将一个规模为N的问题分解为K个规模较小的子问题，这些子问题相互独立且与原问题性质相同。求出子问题的解，就可得到原问题的解。-The basic idea of divide and conquer algorithm is a scale problem is decomposed into N K a smaller sub-problems, these sub-problems are independent and original problems of the s