-
Polynomial
Polynomial基于数据结构的思想,文件比较小,可以直接运行(Polynomial based on the idea of data structures, file is relatively small and can be run directly)
- 2013-12-11 11:05:18下载
- 积分:1
-
mofanwenti
魔方问题
数据结构
使用c++
经典问题(Cube problem
Data Structure
Using c++
Classic problem)
- 2014-01-08 22:30:48下载
- 积分: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
-
Eight-Digital
说明: 八数码 对任意数字序列重新排序 高级散列函数 MFC基础编程(Eight Digital
Reorder the sequence of any number
Senior hash function
MFC based programming)
- 2011-04-11 16:31:59下载
- 积分:1
-
Joseph
说明: 约瑟夫问题,四种解法,分别是静态链表,顺序表两种和循环链表(Joseph problems, the four solution, namely a static list, order form and the cycle of two lists)
- 2010-04-23 08:20:53下载
- 积分:1
-
template
说明: ACM及各类基本算法模板,包括数据结构,计算几何,字符串,图论,数学,高精度等许多常用模板(ACM basic algorithm and various templates, including data structures, computational geometry, string, graph theory, mathematics, high-precision, and many other commonly used templates)
- 2009-08-20 22:37:29下载
- 积分:1
-
ExchangeTree
先序创建二叉树,将二叉树所有节点的左右子树交换,再先序遍历输出(create a binary tree in first order, exchange all the nodes of the binary subtree , then preorder output)
- 2014-07-08 21:30:13下载
- 积分:1
-
graph-DFS
邻接表存储图,然后进行深度优先遍历及广度优先遍历。(DFS,adjacent matrix)
- 2013-10-27 20:16:41下载
- 积分: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
-
data-structure-paper
本资料为数据结构的相关试卷,可以帮助大家解决一下有关考试的问题(This information is relevant papers data structure that can help you solve the problems concerning the examination)
- 2013-09-18 08:16:24下载
- 积分:1