资源列表
pipei
- 用堆栈来实现:检查一个算术表达式中所使用的各种括号是否左右匹配。-Stack: check an arithmetic expression using various brackets around the match.
hafuman
- 根据输入的权值建立一棵哈夫曼树,并显示该树的结点序号、双亲结点、左/右孩子结点以及各结点所对应的哈夫曼编码。-Establish a Huffman tree, according to the weights of the input and displays the serial number of the nodes of the tree parent node, left/right child nodes, and each node corresponds to Huffman c
StudentInformation
- 该程序实现的是对一个学生信息系统的管理。根据菜单选项可以分别执行:输入学生信息、显示学生信息、按姓名排序、插入一个学生信息、删除一个学生信息、查找指定学生信息、从文件中整批输入、将信息输出到文件中等功能。-The program is a student information system management. Can perform according to the menu options: Enter student information, student information i
networkflow
- 网络流算法acm,需要了解残留网络和流等基础。-the acm network flow algorithm
data
- 图的链式表示,深度优先、广度优先算法,Dijkstra算法,包括源码程序和ppt所以对学习数据结构很有帮助-Figure chain, depth-first and breadth-first algorithm, Dijkstra algorithm, including the source program and ppt so helpful learning data structures
SendOptimal
- 一个PYTHON实现的次优顺序查找树的生成,可以作为一个参考。-The PYTHON achieve sub-optimal search tree in order to generate can be used as a reference.
Beauty-of-coding
- 一个微软面试的指南,也可以学到很多实用的解决问题的方法。学习算法的好书。-a guide to the interview of microsoft. and you can learn many algorithm as well.
c-data-struct
- 数据结构文档 包含栈队列二叉树排序等基础知识-data struct word documents
Data-structure-and-algorithm
- 《数据结构与算法》以基本数据结构和算法设计策略为知识单元,系统地介绍了数据结构的知识与应用、计算机算法的设计与分析方法-" Data Structures and Algorithms" knowledge unit basic data structure and algorithm design strategy, a systematic introduction to the knowledge and application of the data structure
KMP---MFC
- 数据结构里面的KMP算法的可视化演示程序 MFC实现-Visualization of data structures inside the KMP algorithm demo program MFC implementation
btree
- 从空树开始,依次输入各关键字,建立相应的B树。并实现B树中关键字的插入及删除 -Starting with an empty tree, enter each keyword in turn, establish the corresponding B-tree. And insert and delete keywords in the B-tree
BPTree
- 程序通过B树的存储结构,实现了B树的构造,显示,关键字的插入删除等基本索引功能-Program through the B-tree storage structure, to achieve a B-tree structure display keyword insertion and deletion basic indexing feature
