资源列表
lab03
- 此为线性表的链式存储结构下的功能实现，例如新建、销毁、重置、插入及删除等。-This is the linear form of the chain store structure functions, such as new construction, destruction, reset, insert, and delete.
lab05
- 本用例为二叉树结点的结构和对二叉树的基本操作，设计二叉树的构造、销毁、各种递归的实现等。-This use case binary tree node structure and the basic operation of the binary tree, binary tree structure design, destruction, the various recursive implementation.
lab07
- 本例主要设计查找的有关算法，例如有序表的查找和顺序标的查找，顺序查找、折半查找及二叉排序树上查找的基本思想和算法实现等。-In this case mainly designed to find the relevant algorithm, such as an ordered list of the find and order the subject to find, sequential search, binary search and binary sort tree to find
lab01
- 本实验用例为验证抽象数据类型复数的实现，主要实现c下实现抽象数据类型的加法、减法、乘法运算及复数的形式化输出。-The cases used in this experiment to verify the implementation of abstract data types plural, the main achievement of abstract data types of addition, subtraction, multiplication and plural form
lab04
- 实现了采用顺序存储实现栈的初始化、入栈、出栈操作及链式存储实现队列的初始化、入队、出队操作，有菜单式选项，功能强大。-Stored in order to achieve the initialization of the stack, the stack pop operations and chain store queue initialization, enqueue, dequeue, menu options, powerful.
Josephus
- 约瑟夫环 程序可直接运行 已知n个人（以编号1，2，3...n分别表示）围坐在一张圆桌周围。从编号为k的人开始报数，数到m的那个人出列；他的下一个人又从1开始报数，数到m的那个人又出列；依此规律重复下去，直到圆桌周围的人全部出列。-Josephus program can be run directly known n individuals (No. 1, 2, 3, ... n, respectively) were sitting around a round table. K repor
beibaosufa
- 背包算法 问题描述 给定一组物品，每种物品都有自己的重量和价格，在限定的总重量内，我们如何选择，才能使得物品的总价格最高。-The knapsack algorithm descr iption of the problem given a set of items, each item has its own weight and price, the total weight of the limited, how to choose in order to make the highest
FDTDc
- FDTD模拟一维TM传播，源代码为c语言。。，-FDTD simulation of one-dimensional TM spread, the source code for the c language. . And
Taskassgin
- n个操作员以n种不同时间完成n种不同作业。要求分配每位操作员完成一项工作，使完成n项工作的总时间最少。 -n operator to n different time to complete the n kinds of different jobs. Assign each operator to complete a task, make work completed n the total time at least.
binaryTree
- 二叉树的非递归遍历算法，自己写的，条理比较清楚-Non-recursive binary tree traversal algorithm, write their own, well-organized more clearly
KMP
- 根据课本自己写的KMP算法，c++实现，用dev编译-According to the textbooks written KMP algorithm, c++ dev compiled
STACK1.C.tar
- program to show the implementation of stack datstructure