-
1
说明: 数据结构中的顺序表,是其中的一个重要组成部分(The order of the table data structure is an important component of which)
- 2011-05-06 14:34:13下载
- 积分:1
-
stack
数据结构 堆栈 实现了以下功能:
cout<<"----------------主菜单---------------"<<endl
<<"* 1.建立 *"<<endl
<<"* 2.输出 *"<<endl
<<"* 3.判断栈是否为空 *"<<endl
<<"* 4.栈的长度 *"<<endl
<<"* 5.输出栈顶元素 *"<<endl
<<"* 6.进栈 *"<<endl
<<"* 7.出栈 *"<<endl
<<"* 8.遍历 *"<<endl
<<"* 9.数制转换 *"<<endl
<<"* 10.清空 *"<<endl
<<"* 11.销毁 *"<<endl
<<"* 12.退出 *"<<endl
<<"--------------------------------------"<<endl<<endl (data structure stack)
- 2013-11-01 11:05:10下载
- 积分:1
-
cycQueue
单循环链表,用C++实现
提供入队,出队,判断空等方法(Single cycle linked list, with C++ into the team, the team judge waited in vain for methods)
- 2012-10-08 20:02:15下载
- 积分:1
-
traversinggraph
图的遍历的实现,文字界面,包含深度遍历和广度遍历两种情况~~(Graph traversal implementation, the text interface, including the depth and breadth traversal traverse both cases ~ ~)
- 2010-08-14 14:16:10下载
- 积分:1
-
2.2
已知线性表中的元素以值递增有序排列,并以单链表作存储结构。试写一高效的算法,删除表中所有值大于mink且小于maxk的元素(若表中存在这样的元素)同时释放被删结点空间,并分析你的算法的时间复杂度(注意:mink和maxk是给定的两个参变量,它们的值可以和表中的元素相同,也可以不同)。(Known linear elements in the table to the value increments ordered, and a single list for the storage structure. Try to write a highly efficient algorithm to delete all values greater than mink and maxk elements smaller than (if there is such an element in the table) while the release of the deleted node space, and analyze your time complexity of the algorithm (Note: mink and maxk is given two parameters variables, their values and elements in the table can be the same or different).)
- 2015-04-11 23:11:41下载
- 积分:1
-
joseph
用链表解决约瑟夫问题。
约瑟夫环是一个数学的应用问题:已知n个人(以编号1,2,3...n分别表示)围坐在一张圆桌周围。从编号为k的人开始报数,数到m的那个人出列;他的下一个人又从1开始报数,数到m的那个人又出列;依此规律重复下去,直到圆桌周围的人全部出列。
其中包括一个实验报告,介绍了编程思路和输出结果截图。(List to resolve Joseph. Josephus is the application of a mathematical problem: Given n individuals (numbered 1, 2, 3, ... n, respectively) sitting around a round table around. From number k people began to count off the number to m the man out of the line his next person and from a number off, the man was out of the line number to m so regularly repeated down until roundtable around of the people all of the columns. Including a lab report describes the programming ideas and output screenshots.)
- 2012-08-27 22:37:52下载
- 积分:1
-
tree
C语言树的简单实现,介绍了树你前序遍历,树插入与删除节点的实现(C-tree is simple to achieve, before you introduced the tree traversal, tree insert and delete nodes to achieve)
- 2011-01-11 22:19:07下载
- 积分:1
-
Dynamic-Memory-Allocation
这个程序是有关计算机的动态内存分配的数据结构 可以直接加载头文件与源文件即可使用其中的接口(This program is a data structure for dynamic memory allocation of the computer can directly load the header files and source files you can use one of the interfaces)
- 2012-05-22 16:36:13下载
- 积分:1
-
hellow4
序列二次规划算法,能求解包含约束和无约束的问题,非常方便。(Sequential quadratic programming algorithm to solve constrained and unconstrained contain the problem, very convenient.)
- 2021-01-08 18:18:51下载
- 积分:1
-
single
单链表逆置的源码~提供了源码和源码说明~简单实用,适用于课堂作业程度(Reverse single linked list provides a set of source code source code and source code ~ ~ simple and practical instructions for classroom work degree)
- 2011-02-15 13:58:07下载
- 积分:1