资源列表
Spindle-rigid-body-degrees
- 主轴刚体自由度计算,包含速度方面的计算，字数不够再凑几个字-Spindle rigid body degrees of freedom is calculated
REVERSE1
- 设表的Reverse运算将表中次序反转，实现单链表的Reverse，为公有成员-based questionnaire Reverse Operators will reverse the table order to achieve single-Chain Reverse. members of the public
Cut-of_effect
- 截断效应，演示对直流信号进行截断后，信号频谱的变化，在演示程序中，图形的计算是由已知的时域和频域表达式计算。
DS2
- 2、 表达式求值 问题描述：使用键盘输入表达式，计算表达式的值并输出；将表达式转化成后缀表达式输出，利用后缀表达式求表达式的值并输出。 -2, the expression evaluation problem descr iption: Use the keypad to enter an expression to calculate the value of the expression and output the expression into postfix express
flight
- 应用类模板，链表写的航班系统，可以写入要定的航班及姓名，然后有查找和删除功能-Application class template, write the list of flight systems, flight can be written to and given the name, then find and delete functions are
compare-the-order-of-words
- 比较单词的顺序，输入两个单词，看他们正序排列的先后顺序-Compare the order of words, enter the two words, look at the positive sequence arranged in the order
2-3-tree
- 2—3树是这样一种树： A．每个非叶子结点都有2个或3个儿子； B．每条众树根到树叶的路径长度相等； C．只有一个根结点的树也是2—3树。 本题目要求从键盘输入以整数序列，建立一棵2-3树。所以我的建树构思为以2-3树的插入操作来进行建树。-2-3 tree is such a tree: A. Each non-leaf node has two or three sons B. Each congregation tree roots to leaves is equal
Knap
- 背包问题的模板程序，可适应不同数据类型,使用了模板类-Template program knapsack problem can be adapted to different types of data, using a template class
Heaps
- a heap class + program wriitten in c++. it implements a max heap
Minimum-spanning-tree
- 最小生成树的生成与演算 分为普利姆算法和克鲁斯卡尔算法-Minimum spanning tree
Test3
- 树与二叉树实验。包括二叉树的先序、中序、后序遍历，高度的计算，叶子节点的计算。-Tree and binary tree experiment. Including the first order binary tree, in order, after the traversal, calculate the height, leaf node calculation.
AATree
- 自平衡二叉查找树，试过一些题，应该没什么bug。支持插入、删除、最大/最小值，求第k大，检索，前驱，后继；动态/静态内存都有，静态慢些，不过有些题用动态回MLE，切记-Self-balancing binary search tree, tried some of the questions, it should be no bug. Supports insert, delete, maximum/minimum, seeking the first k large, retrieval, p