搜索资源列表
maxsubsum
- 几种经典算法实现最大字段和问题（分治算法，动态规划算法）
uselinklist
- 分治算法解决一维点对最小距离-partition algorithm to solve one-dimensional point of minimum distance
paike.rar
- 一个基于贪婪算法和分治算法以及回溯法的一个大型IT职业培训机构（湖北银河学院）的排课系统，采用AJAX+Mysql！！,A greedy algorithm based on the algorithm and sub-administration, as well as a large-scale retrospective law IT vocational training institutions (Institute of Hubei Galaxy) the Course Schedu
skyline
- 城市轮廓线问题的实现，利用分治算法，将input1.dat文件放在d盘根目录下-Urban contour implementation issues, using the partition algorithm, the input1.dat files under the root directory on the d
Cityline
- Java实现的采用分治算法的城市轮廓线程序，《算法引论》73页的相应实现源码-Java realization algorithm using sub-rule city contour procedures, Algorithm Theory, 73 to achieve the corresponding source
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
123456789
- 归并排序(merge sort)体现了分治的思想，即将一个待排序数组分为两部分，对这两个部分进行归并排序，排序后，再对两个已经排序好的数组进行合并。这种思想可以用递归方式很容易实现。归并排序的时间复杂度为O(nlogn)，空间复杂度为O(n)。-Merge sorting (merge sort) embodies the idea of partition, about an array to be sorted into two parts, the two parts merge sort
Arithmetic
- 用JAVA完成的0-1背包算法，一共用了四种算法，包括贪心，分治，动态规划，回溯。把工程导入ECLIPSE下就可以了。-JAVA finished 0-1 with a knapsack algorithm, a share of the four algorithms, including greedy, divide and conquer, dynamic programming, backtracking. To work on it under into ECLIPSE.
chessbordcover(java)
- java语言，使用分治的思想，解决经典的棋盘覆盖的问题。-broad cover
yiwei
- 完成一维的最接近点对问题，用的是分治算法进行的-The closest point to complete one-dimensional problem, using a partition algorithm of
The_Square_Game
- 实现java的方块着色，分治算法经典例子， 用图形化界面，说明清楚，欢迎下载哦~-Java coloring to achieve the box, a classic example of divide and conquer algorithm, with the graphical interface, clear instructions, please download the oh
Divide-and-Conquer-maxmin
- 分治策略 maxmin算法 求数组A[1...n]最大最小元素-Divide and Conquer maxmin
src
- 棋盘覆盖问题，算法分治算法的应用，java完成-Board cover problem, divide and conquer algorithm algorithm application, java complete
fenzhiHEdigui
- 实验一 分治与递归 java实现的很好的实验报告-failed to translate
test1
- 分治法实现大整数乘法，其实应该用数组来保存大整数的，再考虑如何去完善这个程序。但分治算法的核心思想已经尽在其中了。-Divide and conquer method for large integer multiplication
Ytriangle
- 杨辉三角用java的实现，采用了分治的思想在里面-The realization of the graph of Yang hui triangle with Java
Myframe.class
- 棋盘覆盖（有界面效果）,分治算法，界面还行-Board cover (interface effect), divide and conquer algorithm, the interface line
ChessBoard
- 大学期间的棋盘覆盖算法，采用分治策略，拥有图形界面。-University during the chessboard covering algorithm using a divide-and-conquer strategy, has a graphical interface.
testfi
- 合并排序，是java实现的。算法思想是递归和分治。-Merge sort java implementation. The algorithm the thinking is recursive divide-and-conquer.
Majority
- 众数问题。使用分治思想处理。对于给定的由n 个自然数组成的多重集S，编程计算S 的众数及其重数。-Public a few problems. Deal with the idea of divide-and-conquer. Calculated for a given n natural numbers multiset S, programming S plural of multiplicity.