资源列表
EE
- 多项式进行加、减、乘、以及微分运算。手动输入。-Polynomial add, subtract, multiply, and differential operation. Entered manually.
wenbenkuangshuruneirong
- 此程序可控制文本框输入的内容,当输入为数字时为正确,否则提示出错信息.-this procedure can control the input text box, when the input of the correct figures, otherwise suggest error messages.
tree
- 数据结构习题之一，建立二叉树、先序非递归遍历、中序递归遍历、后序递归遍历，求叶节点数-Exercise one of the data structure, the establishment of binary tree, the first order traversal non-recursive, recursive in order traversal, postorder recursive traversal, and leaf nodes
U5
- U5_1.cpp 用非递归方法寻找多数元素 U5_12.cpp 模拟桶排序 每桶内分行出处 总体为递增序列-U5_1.cpp with non-recursive way to find the majority of elements in U5_12.cpp simulated barrels per barrel in order to increase the overall sequence of branch origin
tccglxt
- 实验中存储结构使用链表，实现元素的插入和删除，停车厂中使用栈的方式，在便道上使用队列-Experiment using the linked list storage structure, to achieve the element insertion and deletion, for Parking in the way of using the stack, use the queue in the sidewalk
13
- N个游戏者围成一圈，从第一个人开始顺序报数1，2，3。凡报到3者退出圈子。
binarytree
- 用C++ 实现的二叉树的所有操作，包括建立，中序遍历，计算高度，计算每一层上的所有节点等-binary tree
LAB3_3
- 最差适应算法，VC6.0下编译通过，操作系统实验代码-Worst-fit algorithm, VC6.0 compiled by the operating system code experiment
the-shortest-way-to-fly
- 求解欧洲航线上任何两点的最短飞行路径（共载入20个城市）-the shortest way to fly to every cities of Europe
cfile
- 该代码可实现简单行编辑程序例，串操作应用举例，实现串的存储管理
RailSystem
- Traveling through Europe by rail is a cheap and effective way to experience the sights, sounds, and culture of a wide array of countries and cities. Generally, travelers purchase rail passes that allow unlimited travel on the rail system. Individual
Data structure
- 数据结构-二叉树-data structure-Binary Tree