资源列表
C7_hanoi
- 数据结构CAI系统-用C语言开发的教学辅助系统。-data structure CAI system-C language teaching aids development of the system.
lun
- 处理机调度的算法，操作系统的课程设计，主要是应用轮转法进行进程的调度-processor scheduling algorithms, operating system design of Web applications is the main method of the scheduling process
xqhqc
- 这是一个关于最长单调递增子序列的代码能运行-This is a monotonically increasing for the longest sequences of code to run
vcwork
- 上传几个数据结构源代码，比较简单。用标准c++写的。-upload a few data source code structure, relatively simple. Standard c writes.
112213432545435
- n后问题,实现n后问题的求解,并且可以输出最有解-n, n after realizing the problem solving, and can export most Solution
TSP
- 旅行商问题： 某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。-traveling salesman problem : A salesman to a number of cities to sell commodities, known the distance between cities (or travel). He selected from a resident, after
shujijiegou
- 用数据结构做的约瑟夫问题，其中还包括类似问题中的猴子选大王算法 -do with the data structure Joseph problems, which also included a similar problem is the monkey king algorithm election
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.