搜索资源列表
poj2677--TourTSP
- poj2677，算法导论中的DP题目，TSP简化版本
Answer_ITA
- 《算法导论》课后习题答案。 对书中重要习题进行了详细解答和分析，有助于进一步理解重要的数据结构和算法。-The answer book for Introduction to algorithms.
Merge_Sort
- 一个合并排序算法。是按照《算法导论》书中的讲解来写的。-A plan to merge sorting algorithm. In accordance with the
bMinusTree
- b-树的增加,因为我看到的资料里的最大关键字数目为m-1,我考虑了一下,2-3树的删除会比较麻烦,后来看了下算法导论,别人的数目是2t-1,所以相同情况下是2-3-4树,我考虑按照这个因子再写一个,增加删除部分,有问题可以联系我,联系方式在程序中已注明.-b-tree increases, because the information I have seen in the largest number of keywords for the m-1, I consider a bit ,2-3
IntroductionToAlgorithm
- 算法导论 经典中的经典 找了很久才找到 内容我就不深入介绍了 大家自己看吧 不需要账号直接下载-Introduction to the classic algorithm to find the classic for a long time to find the contents of my depth not introduce himself and see the U.S. do not need to account direct download
zhijiexunzbiao
- 算法导论中直接寻址表的C++实现，大家可以参照着学习。-Introduction to Algorithms directly addressing the table C++ implementation, we can look forward to learning.
6
- 算法导论答案，经典中经典无需更多说明，顺利过关斩将。-Introduction to Algorithms answers, the scr iptures do not need more explanation Classic
sort
- 算法导论中第二章所有排序的自己模拟，快速排序，堆排序，计数排序，最大最小数，选择第n个数-Introduction to Algorithms in the second chapter of its own simulation of all sort, quick sort, heap sort, counting sort, maximum and minimum number, select the first n numbers, etc.
MIT.Introduction.to.Algorithms.Second.Edition
- MIT的算法导论，经典中的经典。写程序必看-MIT.Introduction.to.Algorithms.Second.Edition
lcs
- 算法导论中最长公共子序列的实现，采用动态规划方法-Introduction to Algorithms in the realization of the longest common subsequence, dynamic programming method
rbinsert
- 红黑树的插入算法实现，利用算法导论中的伪代码-Red-black tree insertion algorithm, using pseudocode in Introduction to Algorithms
suanfadaolun
- 算法导论第二版，经典中的经典，有需要的借去，欢迎交流-Introduction to Algorithms Second Edition, the classic of classics, by the need to welcome the exchange
introduction-to-algorithms
- 算法导论pdf pdf版算法导论 很详细的一本算法书 书中带有目录 可以方便查看-Pdf pdf version Introduction to Algorithms Introduction to Algorithms very detailed book, a book with a catalog of the algorithm can easily see
algorithms
- 传说中超越了算法导论的书籍 算法方面的经典之作 值得一看 -classical introduction about algorithms
Introduction-to-algorithms
- 算法导论的中文版。经典中的经典。便于学习各种算法-Introduction to Algorithms, the Chinese version. The classic of classics. Various algorithms to facilitate learning
Job1
- 算法导论练习2.3-7：请给出一个运行时间为Θ(nlgn)的算法，使之能在给定一个由n个整数构成的集合S和另一个整数x时，判断出S中是否存在有两个其和等于x的元素。-Introduction to Algorithms Exercise 2.3-7: Please give a running time of Θ (nlgn) algorithm, so that it can in the given form by a set of n integers S and another inte
fft
- 改进的算法导论中的fft代码，将nlogn的复杂度下降到n，编译成功，4096个数据点时常为2秒。-Fft code in the Introduction of the improved algorithm will be the nlogn of complex decreased to n successful compile 4096 data points from time to time for two seconds.
Word_Ladder
- 算法导论中的，关于 leetcode oj， word_ladder的问题源代码 -Introduction to algorithms, on leetcode oj, word_ladder problem source code
Word_LadderII
- 算法导论中，关于leetcode oj， word_ladderII的问题源代码 -Introduction to Algorithms, regarding leetcode oj, word_ladderII problem source code
QuickSort
- 算法导论中的快速排序算法的具体实现，包括对该算法的简单变形，其中采用文件输入，包括正序，逆序，随机情况的不同输入-Introduction to Algorithms concrete realization of fast sorting algorithms, including the algorithm is simple deformation, which uses the file input, including positive, reverse, random situati