资源列表
GRID.rar
- 把dat文件转化为grd文件 供surfer使用,Dat file into the GRD surfer documents for use
1001.zip POJ 1001己AC源代码
- ＰＯＪ １００１己ＡＣ源代码，不信你可以试试．,POJ 1001 F AC source code, do not believe you can try.
rs.rar
- rs纠错算法，详细介绍了RS编码和解码的过程，以其对大家有所帮助,rs error correction algorithm, described in detail RS encoding and decoding process, and its help for all of us
LCS.rar
- 求两个字符串的最长公共子序列，使用递归算法实现。,For two of the longest common sub-string sequences, using the recursive algorithm.
DictionaryTree.rar
- 字典树算法，可以很方便的实现多叉树，而且查找很方便，是ACM算法设计中常用的数据结构,Dictionary tree algorithm, can be very convenient multi-tree, and find very convenient is the design of ACM algorithms commonly used data structure
APhash.rar
- 常用的hash算法APHash，该hash算法可以实现均衡分布，让数据均匀的分布在hash列表中,Commonly used hash algorithms APHash, the hash algorithm can achieve a balanced distribution, so that uniform distribution of data in the hash list
final.rar
- 有以下七种排序法的实现方法，1冒泡排序,2顺序插入排序,3快速排序,4折半插入排序,5希尔排序,6.选择排序,7归并排序，并分析了各种排序法的性能。程序调通了，完全没有问题。,There are seven methods to sort the law, 1 Bubble Sort, Insertion Sort 2 order, 3 Quick Sort, Insertion Sort 4 half, 5 Hill sort, 6. Choose Sort, 7 merge sort, an
POJ_report.rar
- 总共80多道题的POJ详细解题报告，每道题带ppt说明，很好很强大 ,A total of more than 80 questions the POJ report detailed problem-solving, with each title ppt shows that a good strong
GraphTrace.rar
- 用标准C++完成对图的深/广度优先搜索,使用邻接多重表的存储结构,Using standard C++ Completion of the map deep/breadth-first search, the use of the adjacent multi-table storage structure
tanxinfa.rar
- 北京大学研究生课程“算法分析与计算复杂性理论”的课件，讲的是贪心算法。,University post-graduate courses
SearchMedian.rar
- 寻找无序数组的中位数，实际上代码实现了寻找无序数组中任意第x大的数，使用了快排的思想。VC++ 2005环境,Find disordered array median, in fact, code has to find a disorderly array of arbitrary section x large, use the quick thinking of row. VC++ 2005 Environment
UpperNum.rar
- 给定一个数组A，里面只出现0-9这10个数字，但不一定全部出现，然后给定一个K的值，求A中大于K的整数当中最小的一个，并输出。例如A={0，1}， k =12,则结果为100. vc++ 2005环境,Given an array A, which only the 10 digits 0-9, but not necessarily all appear, and then given a value of K, and K is greater than A, the smallest in