资源列表
1
- a．输入一组整型元素序列，建立线性表。 b．实现该线性表的遍历。 c．在该线性表中查找某一元素,查找成功显示查找元素,否则显示查找失败。 d. 在该线性表中删除或插入指定元素。 -a. Enter a group of integer elements in sequence, a linear form. b. To achieve the linear traverse table. c. In the linear search for a particular eleme
beibaotanluanchengxu
- 利用c语言写的背包贪婪算法，程序简短精炼，希望对大家有所帮助-Using c language written backpack greedy algorithm, program short refining, want to help everyone
Cpp2
- 建立无向图和有向图，实现图的深度遍历和广度遍历。-The establishment of an undirected graph and directed graph to achieve the depth graph traversal and breadth of the traverse.
stack_and_queue
- 以字符序列的形式从终端输入语法正确的、不含变量的整数表达式，利用给定的算符优先关系把中缀表达式转换成计算机容易处理的后缀表达式。本实验中操作数规定为1位数字字符，运算符只有+、-、*、/。-In the form of a sequence of characters entered from the terminal grammatically correct, non-integer variable expression, using the given operator preceden
Sparse_Matrix
- 本实验是实现稀疏矩阵的加法运算，稀疏矩阵采用顺序结构存储。-This experiment is to achieve sparse matrix addition operation, using the order structure of sparse matrix storage.
Tree_Frame
- 掌握二叉树的创建、遍历的方法。 利用二叉树的按层遍历序列创建二叉树，然后实现二叉树的前序、中序和后序遍历。-Master binary tree creation, traversal methods. The use of binary tree traversal sequences by layer to create a binary tree, and then to achieve binary tree preorder, inorder and postorder trave
jcddu
- 计算机操作系统轮转法调用进程实验Computer operating system calls the process of Round-Robin Experiment-Computer operating system calls the process of Round-Robin Experiment
OS
- 计算机操作系时间片实验Computer operating system time-slice experiment-Computer operating system time-slice experiment
LineList
- 线性表链接，已知A链表和B链表，A、B链表可随意输入，在不占用新空间的情况下，用指针实现链接，间隔插入形成C链表-line list:combine LineList A and LineList to Linelist C without open a new area
MiGong
- 迷宫算法：手动生成迷宫，自动寻找出路,简单的小程序-maze: you can create a maze then it will figure out a way out
SqQueue
- 顺序队列模板类，支持多线程。仅一个头文件定义。-Queue template class in order to support multi-threading.
SevenStylesOfQsort
- Qsort针对不同数据类型的用法，Qsort采用快排实现，比传统的sort更有效率-Qsort for the usage of different data types, Qsort exclusive use of quick implementation, more efficient than the traditional sort