搜索资源列表
Ajax-Web-2.0(Java)
- 征服Ajax Web.2.0.快速入门与项目实践(Java) 光盘完整源码-Conquer Ajax Web.2.0. QuickStart project practice (Java) CD-ROM is a complete source
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.
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
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.
IntegerMultiply
- 算法分析与设计 用递归分治算法解决大整数乘积问题(java源码)-Algorithm Analysis and Design Recursive divide and conquer algorithm to solve the problem of large integer multiplication. (Java source code)
java
- 用的分治法的思想,凸包顶点正好可以构成循环,感觉比较新颖,就是不断顺时针旋转,按照书上那个公式不断找出左边的点和顶点,不断存入到数组中,最后的输出刚好是顺时针的输出,创建了好几个数组,其中还有一个三维数组,用法比较特殊,无意间想到的-Ideological divide and conquer, the convex hull of the vertices can just constitute a cycle, feeling relatively new, is constantly r
MvcCms
- MvcCms架构分析(底层框架分离)源码 MvcCms该项目是系Orachrd Oxite 一系列MVC3应用比较成熟的产品之一,开发都是以微软开发模式“分而治之”为基础。 涉及到的技术; 1.MVC3 2.CastleWindsor 3.ServiceLocator 4.多UI, 5.MemberProvider 6.Cache(在该项目中Cache的应用也是一个很好的实例,重点在于Cache与动态信息结合的使用。以及Cache自动更新。) 关于Castle
grid
- 分治算法的直观应用,有GUI。即在8*8的格子中放一块障碍,求一种分配方案使得能用相同的直角方块(共3块成L字形)铺满整个方格。-Divide and conquer algorithm intuitive applications, there GUI. Ie 8* 8 grid put an obstacle, seeking an allocation scheme makes possible the same rectangular box (a total of three L-sh
SUANFAclass
- 算法中有关最小堆的算法,插入删除等。以及分治算法,排序算法-Algorithm for minimum heap algorithm, insert or delete. As well as divide and conquer algorithm, sorting algorithm
nearestpoint
- 随机在二维平面上生成一千个点,再利用分治算法计算这一千个点中的最近点对,并返回这两个点的距离和坐标-Randomly generated on a two-dimensional plane a thousand points, and then use divide and conquer algorithm to calculate these thousand points of the nearest point on, and return from, and coordinate t
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!
posthost
- 邮局选址 问题描述:在一个按照东西和南北方向划分成规整街区的城市里,n个居民点散乱地分布在不同的街区中。用x坐标表示东西向,用y坐标表示南北向。各居民点的位置可以由坐标(x,y)表示。要求:为建邮局选址,使得n个居民点到邮局之距离的总和最小。 提示:带权中位数(分治算法) -Post office location problem descr iption: a north-south direction and in accordance with what is divided
合并排序
- 合并排序是建立在归并操作上的一种有效的排序算法。该算法是采用分治法(Divide and Conquer)的一个非常典型的应用。合并排序法是将两个(或两个以上)有序表合并成一个新的有序表,即把待排序序列分为若干个子序列,每个子序列是有序的。然后再把有序子序列合并为整体有序序列。将已有序的子序列合并,得到完全有序的序列;即先使每个子序列有序,再使子序列段间有序。若将两个有序表合并成一个有序表,称为2-路归并。合并排序也叫归并排序。(Merge sort is an efficient sortin