-
sad
编程 主范式 使用真植表
用栈的应用 使用了 后缀表达式
(biancheng zhu fanshi)
- 2012-06-18 14:16:30下载
- 积分:1
-
Czhihen
关于C语言的一些指针的处理算法,能够使得初学者对C语言指针有自己的了解(Some pointers on C language processing algorithms, it is possible to make a beginner C language pointer has its own understanding)
- 2016-06-17 11:29:59下载
- 积分:1
-
youlishi
有理数的算法,包括其加减乘除,启用的是单链表的形式来表达(Rational algorithms, including addition, subtraction, enabling a single-chain form of expression)
- 2011-10-13 10:00:21下载
- 积分:1
-
heap
实现栈的基本操作,建栈,进栈,出栈,数据结构实现(To achieve the basic operation of the stack, built stack into the stack, the stack data structure)
- 2013-04-03 11:08:37下载
- 积分:1
-
Cpp1
校园导游,可以选择景点序号来了解景点,通过选择两点可计算最短距离和最近路线。(Campus tour guide, you can choose the attractions serial number to understand the attractions of by selecting the shortest distance can be calculated and the recently routes.)
- 2012-06-20 21:57:32下载
- 积分:1
-
RBtree
使用C++/C语言实现的红黑树,对于数据结构的学习有所帮助。(Use red-black tree C++/C language for learning data structures helpful.)
- 2014-05-16 16:09:57下载
- 积分:1
-
main5
编写一个将二叉树的所有叶子结点从左向右链接成单链表的算法(Write a binary tree leaf nodes from left to right links into a single linked list algorithm)
- 2012-10-07 23:52:44下载
- 积分:1
-
Untitled
航迹起始中的逻辑航迹起始算法源代码,本代码具有很好的航迹起始效果!
(Track initiation logic for track initiation algorithm source code, this code has the effect of track initiation)
- 2012-06-06 21:35:20下载
- 积分:1
-
SeqQueue
数据结构循环队列的实现 在visual c++6.0运行(Circular queue data structure to achieve the visual c++6.0 run)
- 2013-06-15 16:27:32下载
- 积分:1
-
fast_sort
/*快速排序:以待排序元素中的第一个元素作为基准将带排序的元素分为三组
*大于基准元素为一组置于基准值的右边,小于基准值的元素为一组置于基准值的左边,
*基准值为一组,这样就找到了基准元素的位置就确定了
*如此递归调用。直到每一组的low==high,即实现了排序的要求。
*/
(/* Rapid Sort: the first element to be sorted in the element as a basis with with sorting the elements are divided into three groups* is greater than the reference element of a group is placed on the right side of the reference value, smaller than the reference value elements for a group of placed on the left side of the reference value,* reference value, a group, so that the location of the reference element is found it is determined* so recursive call. Until each group of low == high to achieve the requirements of the sort.* /)
- 2012-10-26 21:42:43下载
- 积分:1