资源列表
Solving-expressions
- 简单算术表达式的求解,利用栈的后进先出的特点,加入了对算式合法性的判断-Solving simple arithmetic expression, the use of LIFO stack characteristics, added to the formula to determine the legality of
danlianbiao
- 单链表，软件基础的基本处理方法。很简单，不过功能比较全-Single linked list, the software foundation of the basic approach. Very simple, but full-feature comparison
Huffman
- 运用赫夫曼编码的最优前缀码的贪心算法构造huffman树： 首先扫描输入文件，统计出现的字符以及每个字符出现的次数。每次取出现次数最小的那两个节点(node)合并成一个节点(node)，并且将累计数值相加作为新的接点的累计数值，最顶层的是根节点(root) -Huffman coding using optimal prefix code of the greedy algorithm constructs huffman tree: First, scan the input file,
ptrmulti
- windows下的C语言编程，实现的是多种排序方法。-windows of the C programming language, to achieve a variety of sorting methods.
Exp_1
- 一元稀疏多项式的表示及加法运算 (1) 多项式以指数递增的顺序输入。 (2) 设计的数据结构应有利于表示任意一元稀释多项式。 （3）输出原始多项式及运算结果。 -One yuan sparse polynomial representation and addition operations
2
- 贪心算法求解零件加工问题，ACM程序设计题！-Greedy algorithm to solve the problem parts processing, ACM programming questions!
6
- C语言编写的数据结构源码（附带题目，涵盖数据结构中的多项知识点）。-C language source code data structures (with the subject, covering knowledge of data structures in a number of points).
paixu
- 输入几个数字后进行的各种排序，以及显示排序所需时间-After typing a few numbers for a variety of sorting, and display the time required for sorting
chengji
- 输入30个以内学生成绩后，按从高到低排序-Input less than 30 pupils, the high to low Sort by
The-graph-traversing-algorithm
- 以邻接矩阵或邻接表为存储结构，以用户指定的顶点为起始点，实现无向连通图的深度优先及广度优先搜索遍历，并输出遍历的结点序列-The adjacency matrix or adjacency list for the storage structure to user-specified vertex as a starting point to achieve a connected undirected graph of the depth-first and breadth-first se
Josephus
- 基础问题，用循环链表实现约瑟夫问题，数据结构作业-Basic problem, the problem with the circular linked list implementation Joseph, the data structure operations
stack
- 栈是限制仅在表的一端插入和删除的线性表，是生活中某些过程的抽象。插入和删除操作的一端称为栈顶，插入操作称作入栈（Push），删除操作称作出栈（Pop）。栈顶元素总是最后进栈的，和最先出栈的；而栈底元素是最先进栈，最后出栈。栈具有后进先出（LIFO）的特性。顺序栈是栈的顺序存储结构的实现。链栈是栈的链式存储结构的实现。-Stack is limited only to one end of the table insert and remove a linear form, is the life