搜索资源列表
dbPoint.c
- C语言实现，分治法求平面中任意个点的最近点对和最近距离。-C language implements, find out the shortest point pair and the shortest length between arbitrary points in a plane, with divide and conquer method.
KitBag
- 分治法和蛮力法求解最近点对问题,不好意思中文传不了，改传背包问题了。-leastport
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
QuickSort
- 分治法快速排序使用分治法快速排序分治法快速排序 使用分治法快速排序-Quicksort for fenzhifa，you use youkonowQuicksort for fenzhifa，you use youkonowQuicksort for fenzhifa，you use youkonow
fenzhifazuiyoujiewenti
- 分治法解决最优解问题，很好很强大 分治法解决最优解问题，很好很强大-Divide and conquer the optimal solution to solve the problem, very good very strong Oita conquer the optimal solution to solve the problem, very good very strong
fenshu
- 算法分析中的分书问题，运用分治法解决的经典问题-Analysis of algorithms written in the sub-problem, the use of divide and conquer to solve the classic problem
suanfa
- 常用算法,为初学者服务,简单易懂,常用的算法设计方法： 数值算法：迭代法、递归法、插值法等； 非数值算法：分治法、贪婪法、回溯法等。-Commonly used algorithms, for beginners service, easy to understand, common algorithm design methods: numerical algorithms: iterative method, the recursive method, interpolation m
fenzhifa
- 分治法的应用 将序列A(0：n-1)中元素按照升序排序方法:归并排序和快速排序((1)对于快速排序,主元采用三者A(low),A(high),A((low+high)/2)中其值居中者-Divide and conquer the application of the sequence A (0: n-1) elements in ascending sorted by: Merge sort and quick sort ((a) for Quick Sort, the main elemen
Divfuntion
- 算法分析实验 算法分析分治法 最近点对问题-Experimental analysis of algorithms analysis of algorithms divide and conquer the nearest point of the problem
fenzhi
- 正好在写用分治法求众数问题实验报告，写好了，让大家看下-Just writing to use divide and conquer the problem seeking plural experimental report, written, and let everyone Kanxia
suanfa
- 编程实现最大子段和问题的求解（分别采用分治法和动态规划法求解）。-Programming the largest sub-segment and the problem solving (respectively divide and conquer and dynamic programming method to solve).
revcount_MergeSort
- 统计两个序列中的逆序对。经典的分治法，采用归并排序的框架实现。-Counting reverse pairs
RSA
- RSA算法加密与解密，MFC精美的添加SKinMagic皮肤的可视化界面，采用了分治法处理大整数取模问题-RSA algorithm for encryption and decryption, MFC delicate skin to add SKinMagic visual interface, using divide and conquer the problem to handle large integers modulo
algorithm_report
- 算法设计报告5个重要算法，包括贪心，回溯，动态规划，分支限界，分治法，每种算法介绍及实例问题代码，C++成功编译运行-Algorithem report including 5 Major algorithms
shortestpath
- 用蛮力法和分治法求最近点对的问题-用蛮力法和分治法求最近点对的问题............
qi_pan
- 用C++语言编写的残缺棋盘问题的分治法源代码，很完整，可直接编译运行。-Using C++ language problems and incomplete chessboard divide and conquer the source code, it is complete, can be directly compiled to run.
Search
- 用c 实现 的分治法排序，比一般的排序算法要好点，主要是给初学者一个很好的练习版本-a Good sort Design
MergeSort
- mergesort分治排序 - 先产生1000个随机数，连续分为3组，直到每组只剩k个元素，分别排列每组数，再用分治法合并数组-mergesort- randomly generate 1000 numbers, then split it into thirds, subarray is of size- k, stop the recursion and use insertion-sort to sort the subarray, then merge sort
Computeralgorithmsr
- 计算机算法_贪婪算法 计算机算法（贪心算法，遍历搜索，递归，回溯法，分治法，分枝定界) 关于这方面的介绍-计算机算法_贪婪算
DivideConquer
- 使用C使用分治法实现了在一个乱序集合中求最大值,最小值的算法,运行环境：linux,g-The use of C using the divide and conquer to achieve an out of order in order to set the maximum, minimum algorithm, operating environment: linux, gcc