资源列表
Huffman
- 本目录下的源代码均属示例、教学性质。作者不对这些代码的功能和性能作任何担保或承诺。 -------- 功能说明 -------- 本目录下的程序用8种不同的方式实现了Huffman编码算法，这8种方式分别是 * huffman_a 使用链表结构生成Huffman树的算法，这是最基本的实现方法，效率最低。 * huffman_b 使用《数据结构》（严蔚敏，吴伟民，1997，C语言版）中给出的算法，将二叉树存放在连续空间里（静态链表），空间的每个结点内
list
- 数据结构，用链表实现学生成绩信息输入删除等操作！-Data structure, with list of students to achieve results such as information input operation to delete!
LinkStack
- 这是一个本人刚接触数据结构时仿编的一个简单的程序,希望对大家有所帮助!-This is a data structure I刚接触made imitation of a simple procedure, I hope all of you to help!
shu
- 这又是一个C++ 编写的数据结构,里面有许多最基本的功能,如栈\队列\树等.应该有一定的帮助.-This is a C++ Prepared data structure, there are many of the most basic functions, such as trees, such as stack queue. There should be some help.
datastructure
- 数据结构课程设计 老师的DEMO,规范编程，适合学习算法思想和编程规范-Data structure course design teacher DEMO, standardized programming, learning algorithm suitable for programming ideas and norms
2nd_chapter
- 《算法设计与分析》王晓东编著，第二章递归与分治策略课本例子代码实现- Algorithm Design and Analysis edited by Wang Xiaodong, chapter and sub-rule strategy recursive textbook example of code to achieve
lab
- 《算法设计与分析》王晓东编著，第一、二、三章上机实验课 - Algorithm Design and Analysis edited by Wang Xiaodong, one, two, three chapters on experimental class aircraft
tree_rebuild
- 给一棵结点编号为1, 2, …, n 的二叉树的前序遍历序列和中序遍历序列，输 出后序遍历序列-To a node numbered 1, 2, ..., n of the binary tree traversal Preorder traversal sequence and in sequence, the output after the traversal sequence
stack
- 用栈实现算术表达式 一个小小的科学计算器，根据用户输入的表达式计算出结果-Arithmetic expressions using stacks to achieve a small scientific calculator, in accordance with user input to calculate the results of the expression
pointNear
- 分治法解决最近点对问题，包括两种情况，考虑边界内四个点-Sub-rule method to solve the nearest point on the issues, including the two situations, consider the four-point boundary
avlTree
- 平衡二叉树的高效率实现，可用于一般的数据查找，检索，效率非常高！-Balanced binary tree to achieve high efficiency, can be used for general data search, retrieval, efficiency is very high!
cankao
- 野人传教士问题，利用产生式系统解决，主要是说明。-Savage missionary problems, the use of production system to solve, mainly states.