资源列表
stack
- 不带头结点的链式堆栈类,1、 定义并实现不带头结点的链式堆栈类，除构造和析构函数外，成员函数还有入栈、出栈、取栈顶元素、判断堆栈是否非空，头文件为“nohead_LinStack.h”。-node does not take the lead in the category of chain stack, 1, and the definition does not take the lead in realizing the chain nodes stack category, In add
queue
- 队列,1、 掌握队列的顺序存储结构和“假溢出”的处理方法 2、 设计用标志位解决“假溢出”问题的顺序队列 -cohort, 1, the master queue storage structure and sequence "false spillover" of the two treatment methods. Design signs spaces, "false spillover" in the order queue
circlechain
- 定义并实现带头结点的循环双向链表类，除构造和析构函数外，成员函数还有取数据元素个数、插入、删除、取数据元素-definition and take the lead in achieving the cycle node type two-way linked list, in addition to the structural and destructor function, members also function from the number of data elements, in
shunxuchazhao
- 顺序查找法 关于数据结构的基本查找算法实现-law on the order of search data structure of the basic search algorithm
bitree
- 用C++实现二叉树的建立，删除，添加。主要使用的是类的结构。-C realization of the establishment of binary tree, delete, add. The main category is the use of the structure.
knight
- 骑士遍历问题，在一个n*n个方格的国际象棋棋盘上，马（骑士）从任意指定方格出发，按照横1 步竖2 步，或横2 步竖1步的跳马规则，走遍棋盘的每一个格子，且每个格子只走1次。-Knight, in an n * n box at the international chess board, Ma (Knight) from the arbitrary designation box and, in accordance with a further horizontal two-step vert
bstringk
- 离散01串问题，(n,k)01 串定义为：长度为n 的01 串，其中不含k 个连续的相同子串。对于给定的正整数n 和k，计算(n,k)01 串的个数。-discrete series of 01 questions, and (n, k) 01 Series : the definition of the length of n strings of 01, which is non-consecutive k-the same string. For a given positive inte
disk
- 磁盘文件最优存储问题，设磁盘上有n 个文件f1, f1,fn，每个文件占磁盘上1 个磁道。这n 个文件的检索概率分别是p1, p2, , pn-document optimal disk storage, disk based on documents n f1, f1, fn. each file on disk for a cylinder. N This document retrieval probability were p1, p2, and pn
Data_stucture_codes
- 包含各种测试,查找和算法等代码,如冒泡算法,树的遍历,链表,队列,堆栈等-includes various tests, such as search and algorithm code, such as Bubble algorithm, the tree traversal, linked list, queue, stack, etc.
dart
- 双数组建树代码，简单扩张就可以使用的，欢迎大家下载使用-achieved double-array code, the simple expansion could use, we welcome downloading
JIHE
- 数据结构的 用有序表实现集合的基本功能~交集 并集 插入 删除~界面美观~可操作性强-data structure using the table to achieve an orderly set of basic function-set intersection and inserted delete ~ ~ operable aesthetic interface strong
otree
- 用C实现的基于O-tree的ic设计布图布线工具源代码,有相关文档-C realized based on O-tree-id wiring layout design tools source code, related documentation