-
traversinggraph
图的遍历的实现,文字界面,包含深度遍历和广度遍历两种情况~~(Graph traversal implementation, the text interface, including the depth and breadth traversal traverse both cases ~ ~)
- 2010-08-14 14:16:10下载
- 积分:1
-
calc
这是我在学习数据结构做练习时写的一个小程序,功能是在命令行下进行形如:23+34*3/4+(3*6+10)的四则运算,支持+,-,*,/,(,)进行整数运算。(This is a simple code about data structure.It uses to carry on four arithmetic operations with parenthesis.But now it only supports integer.)
- 2009-12-28 12:15:21下载
- 积分:1
-
Calender
日历显示,查询1900年后的日历。每一屏显示一年的日历祥情。(Calender dispaling. Acess the calender detail of years after 1900.)
- 2011-12-18 14:57:15下载
- 积分:1
-
FinalExam
C语言期末考试题,含答案。数组、链表、函数等的使用和C编程。(failed to translate)
- 2011-11-07 20:07:25下载
- 积分:1
-
Monkeys-and-peach
Monkeys and peach,Monkeys and peach(Monkeys and peach)
- 2013-09-01 22:06:42下载
- 积分:1
-
Airlinereservationsystem
用从语言实现飞机订票系统。程序中用到了数据结构中的队列和栈。(From the language used airline reservation system. Process the data structure used in the queue and stack.)
- 2011-06-04 23:19:23下载
- 积分:1
-
tanxinfangfa
说明: 贪心方法是一种改进了的分级处理方法。它首先根据题意,选取一种量度标准。然后按这种量度标准对这n个输入排序,并按排序一次输入一个量。如果这个输入和当前已构成在这种量度意义下的部分最优解加在一起不能产生一个可行解,则不把此解输入加到这部分解中。这种能够得到某种度量意义下的最优解的分级处理方法称为贪心方法。(greedy method is an improvement of the classification methods. According to its first title Italy, and a selection of standards of measurement. Then, under such a standard measure of this sort n input, with an input an order volume. If the input current and constitutes a measure of significance in this part of the optimal solution together not produce a feasible solution. this solution will not put this added to the importation of decomposition. This can be a meaningful measure of the optimal solution hierarchical method, known as greedy method.)
- 2006-05-15 21:50:01下载
- 积分:1
-
heapsort
说明: 从最后一个非叶子结点开始从后往前进行调整,保证了根下的所有子树都是最大堆,最后对根进行调整,使整棵二叉树为最大堆,保证了根结点为整棵数的最大值点,完成了建堆的过程,再将根结点跟最后一个结点进行交换,如此反复操作,则堆排序就完成了,其中堆排序的过程采用了满二叉树的概念。(From the final of a non-leaf node after the move began to be adjusted to ensure that the root of all sub-tree are the biggest pile, and finally adjusted to the root, so that the largest heap binary tree整棵to ensure that the root node for整棵the maximum number of points, completed the process of building reactors, and then the last root node with a node to be exchanged, and so repeated the operation, then HEAPSORT completed, of which the process of HEAPSORT a full binary tree concept.)
- 2008-11-11 22:53:42下载
- 积分:1
-
001
二叉树的中序遍历,先序遍历以及后序遍历的算法(Binary tree in preorder traversal, preorder traversal and postorder traversal algorithm)
- 2012-06-03 23:26:44下载
- 积分:1
-
paixu
各种排序算法的实现,如快速排序,冒泡排序,选择排序,堆排序,二分插入排序等(Implementation of various sorting algorithms, such as quick sort, bubble sort, selection sort, heap sort, binary insertion sort, etc.)
- 2010-09-28 22:20:55下载
- 积分:1