资源列表
binarytree
- 二叉树的递归遍历算法 “二叉链表”的类模板，数据结构和算法必备学习程序。-Recursive binary tree traversal algorithm " binary list," class templates, data structures and algorithms necessary learning process.
homework
- 数据结构中的各种排序集合，包括桶排序、插入排序、希尔排序、冒泡排序、快速排序、选择排序、归并排序、堆排序、基数排序、奇偶排序-Data structure in a variety of sorting a collection, including the bucket sort, insertion sort, Shell sort, bubble sort, quick sort, selection sort, merge sort, heap sort, radix sort, odd
datastructures
- 浙江大学2009冬学期陈越老师高级数据结构的课件-Zhejiang University, 2009 Winter semester Chen Yue teacher advanced data structures courseware
arithmetic
- 算法设计与实验题解-王晓东编写 语言：C-Algorithm Design and experiment of Xie- Xiaodong write Language: C++
ds_4
- 1．定义二叉树的链式数据结构。 2．编写函数，创建下图所示的二叉树。 3．编写函数输出二叉树的先序、中序、后序遍历。-1. The definition of binary tree data structure chain. 2. Write a function, create a binary tree as shown in figure below. 3. Write function, the output of the first binary sequence, in o
ds_5
- 1．定义图的数据结构。 2．编写函数，用邻接表实现图的存储结构，求图的顶点的度数。 3．编写函数，输出图的遍历序列。-1. The definition of graph data structure. 2. Write a function, using adjacency list implementation diagram of the storage structure, find the vertex of degree. 3. Write a function, the o
ds_6
- 1．定义哈希表数据结构。 2．除留余数法做为哈希函数、 H(key) = key P 用线性探测再散列解决冲突方法，编写函数，实现哈希造表的过程，并输出哈希表。 3．编写函数，求查找成功时的平均查找长度（ASL）。-1. Define hash table data structure. 2. In addition to leaving the remainder as the hash function method, H (key) = key P re-hashing
DPmissileDefence
- 动态规划入门问题：导弹防御 的解答与源程序，包含样例输入与输出-Introduction to dynamic programming problems: answers and the source of missile defense, including sample input and output
BinaryTree
- 求解线索二叉树中结点前趋和后继的算法以及以相应次序遍历线索二叉树的算法，二叉树的线索化算法的设计-Solving clues to binary tree node before the trend and follow-up algorithm and the corresponding sequence of binary tree traversal algorithm clues, clues to binary tree algorithm design
OS
- 操作系统课程设计 资源管理系统 银行家算法 安全算法 源代码和课设报告-Operating system, curriculum design, resource management system security algorithm banker' s algorithm source code and class-based reporting
CampusTour
- 这个程序的主要功能是进行校园导航 程序可以显示校园内的场馆的位置-The main function of this program is to navigate the campus program can display the location of venues on campus
bank
- 假设某银行有四个窗口对外接待客户，从银行开门起就不断的有客户进入银行。由于每个窗口在某时刻只能接待一个客户，因此在客户众多时需按先后顺序排队，设计一个程序，遵循先到者先办理的原则，模拟银行办理业务的效率最高，客户耗时最少的情形。-Suppose there are four windows of a bank receiving external customers, starting from the bank have continued to open the door into the