-
在COM中使用数组_code
COM中使用SAFEARRAY数组例程,代码中给了两种数组的用法,一种是字符串数组,另一种是自定义数据结构数组。 (use COM SAFEARRAY array routines, a code for the use of two arrays, a string array, and the other is from the definition of array data structure.)
- 2005-07-12 17:00:30下载
- 积分:1
-
Expressions
表达式cpp实现
数据结构实验源代码
实现前序、中序、后序表达式(Expression codes
Formerorder expressions
regular expression&Postorder expressions
)
- 2011-05-30 16:37:42下载
- 积分:1
-
heapSort.cpp.tar
这是一个堆排序的算法源程序,算法被单独写成一个函数,希望对大家有用(This is a heap sort algorithm source code, algorithms are written as a separate function, we hope to be useful)
- 2013-12-12 14:52:48下载
- 积分:1
-
StackandQueue
该ppt包含了栈和队列的数据结构及基本操作,同时还有栈的举例(This ppt contains the stack and queue data structure and basic operation, as well as examples of the stack)
- 2013-12-06 21:02:24下载
- 积分:1
-
数据结构算法集锦
数据结构算法集锦:包括大量常用算法,如求两数的最大公约数、素数的求法、Prim算法、Kruskal算法、最短路径、Dijkstra 算法、排序相关算法、高精度计算相关算法(algorithm data structure highlights include : large common algorithms, such as for the number two majors, for the prime numbers, Prim algorithm, Kruskal algorithm, the shortest path, the Dijkstra algorithm, scheduling algorithms, high-precision calculation algorithms, etc.)
- 2005-06-28 19:55:07下载
- 积分:1
-
shu
大学软件工程数据结构课程设计二叉树实验三种遍历方法(curriculum design,structure data)
- 2017-11-10 13:44:35下载
- 积分:1
-
maze
说明: 由数字1和0组成迷宫,0代表可走路径,程序会用坐标的形式给出每一步的走法(Composed by a maze of numbers 1 and 0, 0 to go the path, the program will use the coordinates given in the form of moves at each step)
- 2011-03-27 20:57:47下载
- 积分:1
-
point
用分治算法(O(nlogn)复杂度)实现寻找n个点中最邻近点对,输出为最邻近距离的平方(Looking for n points nearest point, the output of the nearest neighbor distance squared using the divide-and-conquer algorithm (O (nlogn) complexity))
- 2012-12-16 13:14:04下载
- 积分:1
-
suanfa
自己编写的floyd 最短距离求解程序。实用简单。gcc
(Floyd shortest distance to write your own solver. Practical and simple. gcc)
- 2012-09-02 14:59:02下载
- 积分:1
-
arc
运用二叉树求代数表达式的值,将代数表达式的每个符号用二叉树结点表示,遍历图的每一结点,按结点值得不同采用不同运算方式(Solving algebraic expressions binary tree)
- 2012-06-23 19:52:38下载
- 积分:1