搜索资源列表
Ajax_Lucene
- 《征服Ajax+Lucene构建搜索引擎》一书的光盘源代码。-" Conquer Ajax+ Lucene to build search engine," a book, CD-ROM source code.
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
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.
ClosestPt
- 采用分治算法找距离最近的两点，点数按输入给定，随机产生。能达到1000000个点。-use divid and conquer method to find the nearest points.
ConquerServerSource
- 征服服务端源代码 什么版本自己去研究,不过可以肯定是2.0以上版本的外国源代码-Conquest of what version of server-side source code for their own to study, but you can certainly be 2.0 or above versions of the foreign source code
co
- ramdan yahe and my love
canqueqipanwenti
- 残缺棋盘（defective chessboard）是一个有2k×2k个方格的棋盘，其中恰有一个方格残缺。图1给出k≤2时各种可能的残缺棋盘，其中残缺的方格用阴影表示。注意当k=0时，仅存在一种可能的残缺棋盘。事实上，对于任意k，恰好存在22k种不同的残缺棋盘。用分而治之方法可以很好地解决残缺棋盘问题。-Incomplete board (defective chessboard) is a 2k × 2k a chessboard squares, of which there is exac
LCS.tar
- LCS匹配算法,divide and conquer LCS-LCS matching algorithms, divide and conquer LCS
jingdiansuanfa
- 经典算法+分支限界法+分治法+动态规划+贪心算法+回溯法-Classical branch and bound algorithm+ France+ divide and conquer dynamic programming+++ backtracking greedy algorithm
fenerzhizhisuanfa
- 这是一个ACM试题中的算法，叫分而治之算法，上面有PPT还有实例代码，希望喜欢ACM的同学可以喜欢-This is a Question in the ACM algorithm, called divide and conquer algorithms, there are examples of the code above, there are PPT hope that students like to be like the ACM
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
NearestPoint
- 最近点对问题是许多算法书籍必有得一个要探讨的问题，本人基于王晓军的《算法设计与分析》实现了分治法及传统法的图形化演示程序，大家可以看到两者的算法性能的比较。-The nearest point of the problem is that many books there must be a method to explore the question, I based Wang Xiaojun' s " Algorithm Design and Analysis of"
CommonAlgorithmDesign
- 常用的算法设计方法集合，主要有迭代法、穷举搜索法、递推法、贪婪法、回溯法、分治法、动态规划法-Algorithm commonly used method of collection, mainly iterative, exhaustive search methods, recursion, greedy method, backtracking, divide and conquer, dynamic programming
DivideAndConquer_Algo
- 1. 依照介面提示輸入yes 或 no 2. 每局結束後會印出你心中猜想的兩個數字並計算當次花費的回合數 3. 每局之間可連續 本程式採用的演算法策略為divide-and-conquer algorithm 1. 先將範圍盡量縮小，優先程序為先從小範圍求出一解 2. 盡量以2的次方數取範圍做分割尋找一個數字時，平均最佳的方法必是二分法。 因此如何以最小步數找到第一個解？若搜尋範我採用的方法，就是以最小步數先尋找到一個解，接著再用二分法找出剩餘的一個解。為了讓
lesson3
- 单片机的C语言设计课程，十天征服单片机LESSON3，主讲教师郭天祥-SCM C language design courses, 10 days to conquer SCM LESSON3, Head Teacher Debates
Lesson4
- 单片机的C语言设计课程，十天征服单片机LESSON4主讲教师郭天祥-SCM C language design courses, 10 days to conquer SCM LESSON4 speaker teachers Debates
ChessBoard
- 算法分析与设计中用分治法解决棋盘覆盖问题。-Algorithm Analysis and Design using divide and conquer to solve the problem the board cover.
MINMAX
- find min or max by Divide and conquer
AlgorithmCode
- C++版本的各类算法源代码，包括动态规划法、分治法、贪心法、回溯法、分支限界法、概率算法-C++ source code version of the various algorithms, including dynamic programming, divide and conquer, greedy method, backtracking, branch and bound method, probability algorithm
ThereisnodifficulttolearnLinux
- 大学生攻克Linux系统教程(又名天下没有难学的Linux)。一位在校大学生整理的教程，献给每一位要征服Linux的学习者－五星级的Linux教程。 本书汇集众多Linux学习者的心血与贡献，有很多作者在默默的为你呼喊，感谢他们的贡献。从学习Linux的那天起，我只记住一个词，那就是攻克。 一个障碍，一个学习Linux的最大障碍－无指导－在困扰着每一位企图闯出初中级Linux困境的人。攻克Linux系统教程给你提供动力，帮助你闯出难关。为何这么有把握？原因很简单，天