-
AVLTree
好用的平衡二叉树类库，C++类库编写，
好用的平衡二叉树类库，C++类库编写(AVL tree implementation for C++)
- 2009-03-12 12:02:05下载
- 积分：1
-
xianxingbiaolianjie
线性表的链接实现可利用单链表来实现，每个节点存储一个元素。
利用单链表来实现线性表的元素的插入，删除，修改等功能。
(Linear link table can be used to achieve a single linked list to implement, each node stores an element. Using a single linked list to implement elements of the linear table insert, delete, modify, and other functions.)
- 2011-04-26 11:57:25下载
- 积分：1
-
StringClass
这个代码是STRING类的声明及实现,因为我认为C++类库中的string类比较庞大,找一个函数需要很长时间,所以用一个简单明了的代替之.(STRING kind of statement and realized, because I think the C library string of relatively large, a function for a very long time. Therefore, the use of a simple and straightforward replaced it.)
- 2006-05-17 17:46:58下载
- 积分：1
-
FRFT-algorim
常在该网站下载资料，也想分享些材料上去，这个资料是FRFT算法(Often the site to download information, but also want to share some material up, this information is FRFT algorithm)
- 2020-07-04 13:00:02下载
- 积分：1
-
fibonacci-heap
斐波那契堆是一种具有较好平摊时间的堆数据结构。我使用C语言来实现斐波那契堆。(Fibonacci heap is a heap of time with good flat data structure. I am using C language to implement Fibonacci heap.)
- 2013-09-17 18:02:59下载
- 积分：1
-
Bitree
二叉树的打包数据结构，包括遍历，删除，添加，注释详细(Packaged binary tree data structure, including traversal, delete, add, annotate details)
- 2015-10-04 23:44:33下载
- 积分：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
-
paixu
实现冒泡，快速，希尔排序法。并计算，比较他的次数。(Achieve bubbling fast shell sort. And calculate, compare the number of times.)
- 2012-05-21 22:13:12下载
- 积分：1
-
851DataStructure2009
江苏大学数据结构研究生试题2009Jiangsu University graduate examination papers(Jiangsu University graduate examination papers)
- 2011-09-25 11:51:05下载
- 积分：1
-
LongestIncreasingSequence
找出数组A中最长的递增序列的长度，使用动态规划算法，复杂度为O(N*N)。(Find the longest increasing sequence)
- 2011-09-05 17:36:27下载
- 积分：1
