-
Set
使用C语言建立带头结点链表实现了集合。并进行了性能上的优化。(Achieve set using C to build list witch head node. And make optimization in performance.)
- 2009-11-18 13:29:05下载
- 积分：1
-
string.tar
数据结构课程设计－－实现并对比三种基本的字符串匹配算法(EasyMatch Rabin—Karp KMP)
- 2009-11-08 12:20:02下载
- 积分：1
-
test
使用vc编写的一个动态链接库，测试动态链接库的例程(Vc prepared using a dynamic link library, dynamic link library routine testing)
- 2010-05-28 23:27:09下载
- 积分：1
-
labyrinth
迷宫问题c源代码，大小为8*8的迷宫。主函数中输入开始位置和结束位置的坐标，输出所有可能的路径(Maze c source code, size 8* 8 of the maze. Enter the start the main function of the coordinates of the position and end position, the output of all possible paths)
- 2010-12-19 23:31:36下载
- 积分：1
-
LINKLIST
单链表的增删查改功能,可以实现单链表的创建、传入数据；并能实现对已有单链表的插入数据、删除数据等功能。(Single linked list of additions and deletions check change function, you can achieve the creation of a single list, incoming data insert data of existing single linked list, delete data and functions.)
- 2012-10-31 21:03:50下载
- 积分：1
-
communication
VC简易通讯录，加强C的编程，熟悉链表文件的使用等。(Simple VC contacts, strengthen C programming, familiar with the use of a linked list file.)
- 2012-09-02 17:11:12下载
- 积分：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
-
ahuangCD
这个是数据结构课程设计中阿黄的CD的程序代码的工程文件包(This is a data structure curriculum design A yellow CD program code works package)
- 2013-12-21 18:53:00下载
- 积分：1
-
jose
约瑟夫环（约瑟夫问题）是一个数学的应用问题：已知n个人（以编号1，2，3...n分别表示）围坐在一张圆桌周围。从编号为k的人开始报数，数到m的那个人出列；他的下一个人又从1开始报数，数到m的那个人又出列；依此规律重复下去，直到圆桌周围的人全部出列。通常解决这类问题时我们把编号从0~n-1，最后结果+1即为原问题的解。
(Josephus (Josephus problem) is the application of a mathematical problem: Given n individuals (with numbers 1,2,3 ... n respectively) sitting around a round table. From the number of people gettin k, number of the m man out of the line he s the next person and a number of gettin number to m the man was out of the line and so the law is repeated until the round table were all out of the column. We numbered 0 ~ n-1, the final result is the original problem solution+1 usually solve these problems.)
- 2015-01-09 17:28:41下载
- 积分：1
-
we
说明： 简单的链表实现
链表可以初步了解(A simple list can be linked to achieve a preliminary understanding)
- 2008-12-10 17:08:15下载
- 积分：1
