搜索资源列表
AJAXkaifa
- 征服ajax+lucene书籍各章节源代码ajax部分-conquer ajax + lucene book chapters part of the source code ajax
zhengfuLucene
- 征服ajax+lucene书籍各章节源代码lucene部分-conquer ajax + lucene book chapters part of the source code lucene
Ajax_Lucene
- 《征服Ajax+Lucene构建搜索引擎》一书的光盘源代码。-" Conquer Ajax+ Lucene to build search engine," a book, CD-ROM source code.
MERGE-SORT
- 合并排序是建立在归并操作上的一种有效的排序算法。该算法是采用分治法(Divide and Conquer)的一个非常典型的应用。 合并排序法是将两个(或两个以上)有序表合并成一个新的有序表,即把待排序序列分为若干个子序列,每个子序列是有序的。然后再把有序子序列合并为整体有序序列。 将已有序的子序列合并,得到完全有序的序列;即先使每个子序列有序,再使子序列段间有序。若将两个有序表合并成一个有序表,称为2-路归并。合并排序也叫归并排序。-Merge Sort is an efficient sort
point
- 最近点对问题,采用分治法,编译通过,代码正确-Nearest point problem using the divide-and-conquer method, the compiler through correct code
big
- 大整数乘法,编译通过,采用的是分治法,绝对正确-Large integer multiplication, compiled by the divide and conquer, absolutely right.
Strassen
- Strassen矩阵乘法,运用分治法,书上资料,编译通过-Strassen matrix multiplication using divide-and-conquer method book, compiled by
aa
- 利用分治法,写一个二分检索的递归算法,在计算机上编程实现,同时进行时间复杂性分析。(要求用递归方法实现)-Divide-and-conquer method, write a recursive algorithm to retrieve a dichotomy, computer programming, and simultaneously the time complexity of the analysis. (Using recursive method to achieve)
suanfa
- 算法程序与设计试验中的经典算法的源代码:像是分治递归,贪心,回溯等。-Algorithm design test of the classical algorithm source code: such as divide and conquer recursion, greedy, backtracking.
classical-algorithms
- 许多经典算法问题的源代码,包括数据结构,分治,回溯,动态规划,图论,贪心等等,包括了C,C++和Java代码,已分成文件夹整理好.-Many classical algorithms of the source code, including data structures, divide and conquer, backtracking, dynamic programming, graph theory, greed, etc., including C, C++ and Java cod