资源列表
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
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.
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
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
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.
lab03
- 此为线性表的链式存储结构下的功能实现，例如新建、销毁、重置、插入及删除等。-This is the linear form of the chain store structure functions, such as new construction, destruction, reset, insert, and delete.
lab02
- 此文件是有关线性表顺序存储结构上所有功能的实现，例如构造空表、销毁或重置、元素个数、插入以及删除、返回值的实现等。-This file is the linear table stored in the order structure all functions are implemented, such as empty table structure, destroyed, or reset, the number of elements, insert, and delete, the r
min-heap
- 采用C++语言完成的程序设计课程作业，实现最小堆算法，附带演示程序-C++ language program design course to achieve the minimum heap algorithm, along with the demo program
single-list
- 单链表实现代码，各种操作：数据插入，删除，显示等-Single linked list implementation code, a variety of operations: data insertion, deletion, display
The-longest-common-subsequence
- 运用动态规划思想和策略，解决最长公共子序列问题。-The use of dynamic programming ideas and strategies to solve the longest common subsequence problem.
The-matrix-the-chain-multiplication-
- 运用动态规划思想，解决矩阵链最优算法问题。-The use of dynamic programming to solve the problem of the optimal matrix chain algorithm.
Sorts
- 排序算法，插入排序，折半排序，快速排序，希尔排序-Sorting algorithm, insertion sort, binary sort, quick sort, Hill sorting