资源列表
Huffman-tree
- 哈夫曼树（ Huffman ）又称最优二叉树，是一类带权路径长度最短的树，有着广泛的应用。-Huffman tree (Huffman), also known as the best binary tree is a class of weighted path length of the shortest tree, with a wide range of applications.
Huffman-tree-application-yang
- 哈夫曼树，讲课比赛课件，供大家参考，倾力奉献-Huffman tree, lectures competition courseware for your reference, dedicated effort
Huffman-tree-yang
- 哈弗曼树，讲课比赛教案，供参考，倾力奉献-Hafu Man tree, lectures game lesson plans, for reference, dedicated effort
H5_1
- 可以查找一个随机矩阵中的极大点，极小点，和鞍点，-Find a random matrix can be a great point, minima and saddle points,
H5_2
- 可以查找一个随机矩阵中的极大点、极小点和鞍点-Find a random matrix can be a great point, minima and saddle points
H5_3_1
- 可以实现升序直接插入、对半插入、冒泡、直接选择排序的算法,-Can be achieved directly into the ascending, to semi-insertion, bubble, direct selection sort algorithm
Solution-ToIntroductionAlgorithm
- 经典书籍算法导论课后习题与思考题答案合集，精选习题，英文版-Classic book Introduction to Algorithms answer questions after-school exercise and thinking collection, selection of Exercise, English
jzzh
- 进制间的转化，输入一个 12,10,2 输出结果为 12（10）=1100（2）-The conversion between binary, enter a 12,10,2 output of 12 (10) = 1100 (2)
sort
- vc的几种内部排序，供刚开始学习VC入门的人士进行学习。-vc several internal sequencing, the beginning of learning for those who started learning VC.
3
- 从键盘读入若干个字符串，对他们按字母大小的顺序排序，然后把排好序的字符串送到磁盘文件-Read from the keyboard into a number of strings, the size of their alphabetical sort order, then sorted string to disk file
LongestIncreasingSequence
- 找出数组A中最长的递增序列的长度，使用动态规划算法，复杂度为O(N*N)。-Find the longest increasing sequence
language
- 用C++语言来实现单链表举例的内容和程序-In C++ language to achieve a single linked list examples of the content and procedures