搜索资源列表
maxmin
- 本JAVA程序是基于分治法思想的，取数组最大最小值的程序，可以动态控制数组长度
POINT
- 用分治法找一个平面内的最接近点对。时间复杂度为O（nlogn）.-Using a divide and conquer to find the closest point of the plane pair. Time complexity is O (nlogn)
CPair
- 分治法寻找最接近点对,内附测试文件，算法分析与设计作业-Partition method to find the most close point ，Enclosed test files, the algorithm analysis and design work
ex1_cityoutline_squ
- 用分治法实现城市轮廓问题，开发工具为eclipse,jdk 1.6-Treatment with sub-urban profile issues, development tools for the eclipse, jdk 1.6
closestpoints
- 最短距离点对算法分治法实现 以及暴力算法的对比-Closest Distance Point Pairs Divide and Conque Algorithm
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
MinDistance_PointPair
- 用java实现的平面上最近点对的查找，包括蛮力法和分治法的实现。-Java implementation of the plane with the nearest point on the search, including the brute force method and the divide and conquer implementation.
NearestPoint
- 算法分析与设计经典问题，用分治法求最近点对，并与蛮力法做对比-Classical algorithm analysis and design problems with the divide and conquer method for the last point, and compared with the brute force method to do
test1
- 分治法实现大整数乘法，其实应该用数组来保存大整数的，再考虑如何去完善这个程序。但分治算法的核心思想已经尽在其中了。-Divide and conquer method for large integer multiplication
MatrixMultiply
- 用分治法和Strassen方法，并进行效率的比较，有图形界面，输出结果用log4j输出到文件中。-With partition and Strassen method, and comparison of the efficiency, has a graphical interface, using log4j output the results output to a file
Qipan
- 特殊方格必位于4个较小子棋盘之一中,其余3个子棋盘无特殊方格 用分治法解决棋盘覆盖问题算法接单明了。-Special grid must be located in one of the four smaller sub-chessboard, the remaining three sub-chessboard squares divide-and-conquer method to solve the chessboard coverage problem algorithm orders
java
- 用的分治法的思想,凸包顶点正好可以构成循环,感觉比较新颖,就是不断顺时针旋转,按照书上那个公式不断找出左边的点和顶点,不断存入到数组中,最后的输出刚好是顺时针的输出,创建了好几个数组,其中还有一个三维数组,用法比较特殊,无意间想到的-Ideological divide and conquer, the convex hull of the vertices can just constitute a cycle, feeling relatively new, is constantly r
Permutation
- 分治法源代码 用递归方法求n个数的无重复全排列。-Divide and conquer method source code
MergeSort
- 归并排序算法，该算法是采用分治法（Divide and Conquer）的一个非常典型的应用。-Merge sort algorithm, which is a very typical application using the divide and conquer method (Divide and Conquer) is.
project2100
- 用c语言做分治法之循环赛日程表，由于水平有限，我不知道错在哪里？请指教！-With the c language to divide and conquer the round-robin schedule, due to limited, I do not know wrong? Please advise!
合并排序
- 合并排序是建立在归并操作上的一种有效的排序算法。该算法是采用分治法（Divide and Conquer）的一个非常典型的应用。合并排序法是将两个（或两个以上）有序表合并成一个新的有序表，即把待排序序列分为若干个子序列，每个子序列是有序的。然后再把有序子序列合并为整体有序序列。将已有序的子序列合并，得到完全有序的序列；即先使每个子序列有序，再使子序列段间有序。若将两个有序表合并成一个有序表，称为2-路归并。合并排序也叫归并排序。(Merge sort is an efficient sortin