资源列表
TranslateCalc
- 实现数据结构中的数学中序表达式转换为后继表达式. 并且运算出后序表达式的结果. 运算符号包括 + - * / & | ! ( ) 加 减 乘 除 与 或 非-Implementation data structure in the math expression in the sequence is converted to a subsequent expression. And after computing the result of the expression sequen
kmp
- kmp算法 我模仿着写的 不过还是有些不会 我写了不少注释-i dontEnglish
List
- 实现二叉树以及排序二叉树等功能，是实验室做过的-Binary tree and binary tree sort implementation and other functions, the laboratory did
C_Program100
- 看似简单的算法小程序，但对于我们规范化编程的确很有帮助。-Algorithm seems to be simple and small program, but we are indeed very helpful to standardize programming.
bMinusTree
- b-树的增加,删除,已对八百万个数据进行过测试,而且是对多个M值-b-tree to add, delete, 8,000,000 have been tested data, but also on a number of M values
Bitree
- 实现二叉树遍历的Visual C++程序，要求输入二叉树的各结点后可以算出其三种遍历，即先序，中序，后序。-Binary Tree Traversal implementation of the Visual C++ procedures for the importation of all tree nodes can be worked out after its three ergodic, that is first order, in sequence, after the seque
huffman
- 数据结构中的huffman树的一个具体应用，适合刚开始学习数据结构的朋友！-Data structure of huffman tree to a specific applications, fit the beginning of the study data structure Friend!
artlicense
- very simple nonvisual Delphi component useful for shareware program developing. It uses crypted license files containing information about exe file (size and crc), expired date and any additional information. As TArtLicense uses RSA asymmetric al
linklist
- 用于学习数据结构得初学者学习数据结构单链表，以及和实现单链表与书本上得不同之处-Study data structure for a beginner studying single-linked list data structure, as well as the implementation on a single list with the books were different
rbtree
- 红黑树是一种自平衡二叉查找树，是在计算机科学中用到的一种数据结构，典型的用途是实现关联数组。-AVL trees are actually easier to implement than RB trees because there are fewer cases. And AVL trees require O(1) rotations on an insertion, whereas red-black trees require O(lg n). In practice, the
wu
- 幕上刷新一下，在看看你右下角时间前是不是有你爱人的名字了? 更多电脑小技巧-Click on screen to refresh, to see you at the bottom right corner of time before there is you are not a lover' s name? More computer tips
datastruct_example
- 本人讲授数据结构课程时的所写的示例程序，结构清晰规范，有注释，全部可编译运行，包括如下代码： 长整数：ch0_bigint2.c 顺序表的实现：ch2_stable.c 链表的实现ch2_ltable.c 合并两个有序表：ch2_stable_merge.c 表达式计算：ch3_express.c 队列的链式实现：ch3_lqueue.c 栈的链式实现：ch3_lstack.c 迷宫求解：ch3_maze.c 队列的顺序实现：ch3_squeue.c