搜索资源列表
Tug og war.rar
- Tug of War A tug of war is to be arranged at the local office picnic. For the tug of war, the picnickers must be divided into two teams. Each person must be on one team or the other; the number of people on the two teams must not differ by more than
two
- 严蔚敏编写的《数据结构》第2章的答案，全部为源码-the answers of chapter two of a book called ‘Data Structures’ writen by Yan Wei Min
two-waylinkedlist
- 双向链表，双向链表存储方式的实现及特点；双向链式存储结构的定义及基本运算；双向链表的创建、插入、删除和显示表中元素等基本操作 -A two-way linked list, doubly linked lists stored in achieving and characteristics two-way chain storage structure, the definition and basic operations two-way linked list creation,
Two-waymergesortmethod
- 两路合并排序法，使用C++语言编写用与实现数据结构的两路合并排序-Two-way merge sort method, using the C++ language and implementation of data structures with two-way merge sort
two-unary-polynomial-of-the-product
- 用C语言实现两个一元多项式的乘积，输入数据为两行，分别表示两个一元多项式，每个一元多项式以指数递增的顺序输入多项式各项的系数、指数。最后以指数递增的形式输出乘积。-C language with two unary polynomial of the product, the input data for the two lines, respectively, two unary polynomials, each one dollar increase in the order of pol
minimum-expansion-of-two-strings
- 算法设计类源代码。使用动态规划的方式计算两个字符串的最小扩展距离。-Algorithm design class source code. Calculated using dynamic programming the minimum expansion of the distance of two strings.
Connecting-two-list
- 关于链表问题，通过这个程序可以将两个链表连接在一起-About list, through this program can question two list together
Maze-solving-Two-way-circular-list
- 实现了经典的迷宫求解问题和双向循环链表问题，应用性很强-To achieve a classic two-way circular maze solving problems and problem list, the application of highly
sort-with-two-arrays
- sort with two arrays
comparision--of-two-algorithms
- 对动态规划法和贪心法的分析和比较,通过比较研究来分析各算法的特点。-Analysis and comparision with two algorithms
The-two-way-circulation-list
- 双向链表也叫双链表，是链表的一种，它的每个数据结点中都有两个指针，分别指向直接后继和直接前驱。所以，从双向链表中的任意一个结点开始，都可以很方便地访问它的前驱结点和后继结点。一般我们都构造双向循环链表。-The two-way circulation list
Two-forks-tree-problem
- 二叉树问题 1、 按根、左子树和右子树三部分进行遍历 遍历二叉树的顺序存在下面6种可能： TLR（根左右）, TRL（根右左） LTR（左根右）, RTL（右根左） LRT（左右根）, RLT（右左根） 其中，TRL、RTL和RLT三种顺序在左右子树之间均是先右子树后左子树，这与人们先左后右 的习惯不同，因此，往往不予采用。余下的三种顺序TLR、LTR和LRT根据根访问的位置不同分别 被称为先序遍历、中序遍历和
3dmax-and-vc-and-opengl-two
- 3dmax模型导入到用opengl库和c++实现的小场景中，有两个房子，屋顶是树叶，可以在房子内外漫游，用microsoft visiual studio 2008打开-3dmax model into the library and c++ with opengl achieve a small scene, there are two houses, roof leaves, you can roam the house and outside, with microsoft visiual
Two-binary-sort-tree-into-one
- 数据结构中，将两棵二叉排序树合并成一棵二叉排序树。即，将其中一棵树按中序遍历插入到另一棵树中。-Data structure, the two binary sort tree merged into a binary sort tree. That is, where a tree by preorder inserted in another tree.
experiment-two-
- 数据结构实验：实现分数的+,-,*,/，=,<,>,==等运算符重载,2.实现分数的输入：按照分别输入分子和分母的方式输入；3.实现分数的化简，至少用两种方法实现（辗转相除法）；比较两种分数化简方法的效率,实现分数的输出，格式：5/31； 6/5；100/300；要求输出的分数是简分数-Experimental data structure: achieve scores+,-,*, /, =, < ,> , ==, such as operator overloading,
CPP-two-dequeue
- 用C++的两种方法实现了出队列的功能，代码简洁，可以方便学习和使用，代码确实很好，不用谢，哈哈。-Two ways to achieve a C++ function out of the queue, the code is simple, easy to learn and use, the code is really good, you re welcome, ha ha.
two-way-links
- 双向表，个人为考研精心准备编制，欢迎大家交流讨论。-Two-way tables, individual preparation for postgraduate carefully prepared, we welcome discussions and exchange
delete-the-same-node-of-two-list
- 用c语言实现删除两个链表学好相同的节点，运行环境VC6.0-Realization of two lists by deleting the c language to learn the same node, the environment VC6.0
two-fork-tree
- 根据二叉树的抽象数据类型的定义，使用二叉链表实现一个二叉树。实现二叉树的基本功能。 -According binary abstract data type definition, use two forks to implement a binary tree list. Achieve the basic functions of a binary tree.
two tree
- 本程序中通过C++平台，实现二叉树的链式存储、遍历。(This procedure through the C++ platform, to achieve the two tree chain storage, traversal)