资源列表
redblacktree
- 算法导论之红黑树算法，红黑树主要用在内核的算法，该算法的时间复杂度很好！-Introduction to the red and black tree algorithm algorithm, a red, black tree in the main core of the algorithm time complexity good!
DoubleLinkList
- 数据结构中，关于双向链表的实现，双向链表的实现稍微有点复杂。-Doubly linked list implementations in the data structure, the realization of the doubly linked list is a little bit complicated.
set
- 实现了集合的并，交，差,希望大家能偶有帮助，如果能够跟大家共享我感到非常的高兴-achive intersection,union,difference of set
内部排序问题
- 简单农夫过河问题，利用栈来解决农夫过河问题(Simple farmer crossing the river)
seisView
- UNIX下地震培面显示软件包，有各种变换的代码，可用于参考-UNIX under earthquake Pei surface display package, various transform code, can be used for reference
Huffman
- 基于哈弗曼二叉树的对文档进行压缩和解压缩的C语言程序-Compression and decompression of the C language program based on the Huffman binary documents
Sequence
- 一个法雷序列算法，对任意给定的一个自然数(n<=100),将分母小于等于n的不可约的真分数按上升的次序排序,并且在第一个分数前加上0/1, 而在最后一个分数后加上1/1。-A method mine sequential algorithm, for any given a natural number (n < = 100), less than or equal to the denominator of the proper fraction n irreducible sort
kechongfuzuhewentixiangjie
- 有 n 个不同的元素，每个元素可以选多次，一共选 k 个元素，有多少种选法？例如， n=3,k=2 时，有(1,1), (1,2), (1,3), (2,2), (2,3), (3,3), 共 6 种选法。-There are n distinct elements, each element can be selected multiple times, for a total choose k elements, there are many kinds of election law?
hafumanbianma
- 哈夫曼编码经典算法 私人珍藏 希望 有用-Huffman encoding classical algorithm private collection of the hope that useful
youpiao
- 设有n种不同面值a1, a2,…, an的邮票，规定每封信最多贴m张邮票。对于给定的m，n，求出最大的邮资连续区间。-with different denominations a1, a2, ..., an stamps, each up to the letter m stamp affixed. For a given set of m, n, obtained the largest postage continuous interval.
Clanguage
- 针对初学C语言及数据结构者有很大的帮助，这其中绝大部分是我本人学习C语言及数据结构所做实验后经验证正确的程序。对学习者有很好的引导和帮助作用。-C language for beginners and data structures are very helpful, the vast majority of which I am learning C language and data structure after the experiment done by proven correct
2.表达式计算
- 思路： 1、创建两个栈 linkstack * operand ;//运算数栈 linkstack * operator;//运算符栈 2、扫描表达式。 <1>若是运算数,合并成一个完整的数data。 规则：直接入操作数栈 push_stack(operator_stack,data);(Ideas: Create two stacks Linkstack * operand;/ / operation number stack Linkstack * opera