资源列表
数列极差
- 在黑板上写了N个正整数作成的一个数列，进行如下操作： 每一次擦去其中的两个数a和b，然后在数列中加入一个数a×b+1， 如此下去直至黑板上剩下一个数，在所有按这种操作方式最后得到的数中， 最大的max，最小的为min，则该数列的极差定义为M=max-min。
Cpp1
- 杨辉三角的显示，数据结构，比较戳的做法。-Yang Hui triangle display, data structures, compare the practice stamp.
以二叉链表作存储结构
- 以二叉链表作存储结构，编写一个算法将二叉树左、右子树进行交换的算法。-Write an algorithm to binary trees left and right subtree exchange algorithm for binary list storage structure.
Subseofseveralquestions
- 子集和数问题 实现对图的最小生成树实现，通过此算法可以找到此图中连接所有点的最小生成树-Subset of several questions on the implementation of the minimum spanning tree implementation plans, the passage of this algorithm can find this chart connecting all points of the minimum spanning tree
newtron
- 牛顿迭代算法在C里面的实现，速度不错-Newton iterative algorithm in C inside the realization of the pace. . .
abc
- 单链表的归并排序，你可以用它来实现一个单链表的归并排序。-A single list of merge sort, you can use it to achieve a single list of merge sort.
MergeSort
- Merge sort 归并排序 MIT公开课Introduction to Algorithms 6.046j/18.410j, Lecture 2课堂实例 环境：g++/ Win7 April 15, 2012-Merge sort example MIT Introduction to Algorithms 6.046j/18.410j, Lecture 2 g++/ Win7 Qian Mao, Information Networking Institute, C
huffcodes2bin
- 基于matlab的霍夫曼转二进制代码，非常好用，直接套用即可-Turn-based matlab Huffman binary code, very easy to use, can be applied directly
Expression-evaluation
- 利用堆栈解析算术表达式的基本方法进行表达式求值。-Stack basic analytical methods use arithmetic expressions were expressions.
Dinkelbach
- 最优比率生成树,设计Dinkelbach定理，运用prim算法与迭代算法-Minimum ratio spanning tree
channel-capacity-optimization
- Show the channel capacity can be computed using convex optimization.-Capacity of a communication channel.Show how the channel capacity can be computed using convex optimization.
newton_cg
- 最优化算法 牛顿CG算法的matlab实现-Newton optimization algorithm CG algorithm matlab implementation