搜索资源列表
resueltas
- Java examples for dinamic programming, divide and conquer, greedy algorithms and backtracking.
P1_645002
- An example of a divide and conquer algorithm
mergeSort
- merge sort is a sorting algorithm used for sorting data it uses divide and conquer approach
classicAlgorithm
- 常用经典算法及讲解：贪婪，分而治之，动态规划，回溯，分支定界算法实现和讲解。-Classical algorithm and explain common: greed, divide and conquer, dynamic programming, backtracking, branch and bound algorithm and explain.
HW1
- in this code we do the multiplication with divide and conquer method. it can be known dynamic programming
dye-Divide-and-conquer.ppt
- 动态规划算法及分治的思想在算法设计中的应用。-Dynamic programming algorithm and the ideological division in the algorithm design.
Strassen
- 實現 Strassen s algorithm，用JAVA寫的，可以正常在 windows 執行。(divide and conquer) -Implement Strassen s algorithm
src
- 征服PYTHON--语言基础与典型应用光盘-Conquer PYTHON- language base and the typical application of CD-ROM
Loader
- server data & conquer.exe for patsh 5095
ajax2.0
- ajax 经典书籍 征服ajaxweb2.0-ajax classic books ajaxweb2.0 conquer
ccplusplus
- 《征服CC++企业软件开发核心技术》源代码，其中包括linux和window的代码，对线程，网络通信，数据库等有说明。-" Conquer the CC++ enterprise software development of core technologies," the source code, including linux and the code window for the thread, network communications, database, such
acm_algorithm
- 细说常用算法之分治算法，doc文档，举了四个适用于分治算法的例子：找出伪币、金块问题、矩阵算法、金块问题。都有详细的算法思想说明。-Elaborate algorithms most of the Divide and Conquer Algorithm, doc documents, cites four sub-rule algorithm applied to an example: to find counterfeit coins, gold bullion issues, matri
DataStructureAlgorithm
- 数据结构和算法，非常经典，讲的很详细！第一部分 基础知识 第一章 C++程序设计 第二章 程序性能 第二部分 数据结构 第三章 数据描述 第四章 数组和矩阵 第五章 堆栈 第六章 队列 第七章 跳表和散列 第八章 二叉树和其他树 第九章 优先队列 第十章 竞赛树 第十一章 搜索树 第十二章 图 第三部分 算法设计方法 第十三章 贪婪算法 第十四章 分而治之算法 第十五章 动态规划 第十六章 回
PeachFairy
- peach fairy conquer 5095
DataStructuresandAlgorithmAnalysis
- 全面系统地介绍了队列、堆栈、树、图等基本数据结构，以及贪婪算法、分而治之算法、分枝定界算法等多种算法设计方法。-A comprehensive and systematic introduction to the queue, stack, tree, map and other basic data structures, as well as greedy algorithms, divide and conquer algorithms, branch and bound algorith
devide_conquer
- 分治法解最近点对问题：首先输入点的个数，然后输入点的坐标，输出先是根据x的坐标对点进行排序，然后输出最近点对的距离。-Divide and conquer solution of the nearest point of the problem: First, the number of input points, and then enter the coordinates of points, the output first, according to the coordinates of
Detest1
- C/C++ implementation of a Divide-and-Conquer algorithm
ini
- conquer items to have fun in the game
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.
petroline
- 输油管道问题 计算机算法设计分析 分治法算法实现题-Computer Algorithm Design and Analysis of pipeline issues divide and conquer algorithm question