-
hanoi
简单的汉诺塔的非递归实现算法。用C++实现的。(Simple HANOR the non-recursive algorithm. Achieved with C++.)
- 2013-01-14 15:16:25下载
- 积分：1
-
LongestIncreasingSequence
找出数组A中最长的递增序列的长度，使用动态规划算法，复杂度为O(N*N)。(Find the longest increasing sequence)
- 2011-09-05 17:36:27下载
- 积分：1
-
skiplist.c.tar
A skip list is a data structure for storing a sorted list of items, using a hierarchy of linked lists that connect increasingly sparse subsequences of the items. These auxiliary lists allow item lookup with efficiency comparable to balanced binary search trees (that is, with number of probes proportional to log n instead of n).
- 2011-04-20 12:59:03下载
- 积分：1
-
ZZ
数据平滑，使用按箱平均值平滑法对以上数据进行平滑，箱的深度为3。
(b) 使用按箱中值平滑法对以上数据进行平滑，箱的深度为3。
(c) 使用按箱边界值平滑法对以上数据进行平滑，箱的深度为3。
提示：（1）使用链表，不使用数组。（2）数据放入一个数据文件中，不从键盘输入。(Data smoothing, use according to the box to the above average smoothing data smooth, the depth of the box for 3.
(b) use median smoothing method according to the box to the above data smooth, the depth of the box for 3.
(c) use according to the box the boundary value to the above data smoothing, smooth, the depth of the box for 3.
Tip: (1) using linked list, do not use an array. (2) data in a data file, not from the keyboard.
)
- 2020-06-28 19:20:01下载
- 积分：1
-
Tetris
使用很好的数据结构，程序运行效率高，界面简洁美观。(Good data structure, high efficiency, simple and beautiful interface.)
- 2013-03-27 10:51:16下载
- 积分：1
-
MatchBracket
括号匹配的C语言工程实现，简单易懂，注释详细！更适合编程初学者学习！学习数据结构的最好资料！(Brackets match the C language engineering, easy-to-understand, detailed notes! More suitable for beginners to learn programming! Learning data structure best!)
- 2012-12-03 12:49:31下载
- 积分：1
-
quicksort
数据结构快速排序例程代码，只要按照例子就可以很容易加入到你的程序当中。(Data Structures quick sort routine code, just follow the example you can easily add them into your program.)
- 2013-05-23 15:05:53下载
- 积分：1
-
Maze-code
以一个m×n的长方阵表示迷宫，0和1分别表示迷宫中的通路和障碍。设计一个程序，对任意设定的迷宫，求出一条从入口到出口的通路，或得出没有通路的结论。首先用二维数组存储迷宫数据，迷宫数据由用户输入。一个以链表作存储结构的栈类型，然后编写一个求解迷宫的递归或非递归程序。求得的通路以三元组（i，j，d）形式输出，其中：（i，j）指示迷宫中的一个坐标，d表示走到下一坐标的方向（东、南、西、北四个方向所用代表数字，自行定义） (With an m × n the long square maze, 0 and 1, respectively maze of pathways and obstacles. Design a program, for any set of the maze, find a path from the inlet to the outlet, or come to the conclusion there is no path. First of a two-dimensional array to store the data maze, maze data input by the user. A linked list storage structure for stack type, and then write a recursive or non-recursive solving the maze procedure. Obtained access to triples (i, j, d) in the form of output, of which: (i, j) indicates the maze of a coordinate, d represents the coordinates walked next direction (east, south, west, north four directions used on behalf of a digital, self-defined))
- 2014-01-20 15:41:40下载
- 积分：1
-
2-3Library
大二时做的一个数据结构的课程设计，用2-3树实现的图书馆管理系统，只是控制台程序，没有很好的图形界面。包括管理员、读者。管理员功能有：采编入库、查看图书、查看读者、删除读者。读者功能有：借书、还书、预约、查找等等。。功能全面。包括注册账号，登录需要账号密码。(Sophomore to do a data structure of the curriculum design, with 2-3 tree implementation of library management system, but the console program, not a good graphical interface. Including administrators, readers. Administrator functions include: editing storage, check books, check readers, delete readers. Reader functions: library, book, booking, search and so on. . Full-featured. Including the registration account, login account password required. )
- 2020-10-28 01:10:00下载
- 积分：1
-
Kruskal
克鲁斯卡尔算法思想.cpp
int seekedge(EDGE * (&a), int n)
void bubble(EDGE * (&a), int size)
void searchandjoin(EDGE * (&a1), int k) // a1是图边集头指针，a2是最小生成树边集的头指针，k为所要删的边
void storepicture(EDGE * (&a), int n, VERTEX *b, int m) (Thinking of Kruskal algorithm. Cpp int seekedge (EDGE* (& a), int n) void bubble (EDGE* (& a), int size) void searchandjoin (EDGE* (& a1), int k) // a1 edge set is the first pointer map, a2 is the minimum spanning tree of the first indicators margination, k for the edges to be deleted void storepicture (EDGE* (& a), int n, VERTEX* b, int m) )
- 2009-06-27 01:43:39下载
- 积分：1
