-
list-and-array
数组的定义与使用，数组的运算，字符串的输入与输出，冒泡排序(list and array)
- 2013-10-17 11:32:30下载
- 积分：1
-
Bigint
利用双向链表实现对两大整数的相加运算。
可以修改数组长度实现更大整数的相加(Realize the use of two-way linked list of integers the sum of the two operations. Can modify the array length to achieve a greater sum of integers)
- 2007-10-18 21:34:06下载
- 积分：1
-
8sort_method
随机函数产生10000个随机数，用快速排序、直接插入排序、冒泡排序、选择排序的排序方法排序，并统计每一种排序所花费的排序时间和交换次数。其中随机数的个数由用户定义，系统产生随机数。(Random function generates 10,000 random numbers using quick sort, insertion sort, bubble sort, select Sort sort Sort, and statistics for each sort spend the sort of time and the number of exchanges. Wherein the number of the random number defined by the user, the system generates random numbers.)
- 2013-02-27 17:27:04下载
- 积分：1
-
48qqqq
主要用栈和树求解骑士问题，用C++语言编写的(The main stack and tree Cavalier Problem Solving with C++ languages)
- 2009-03-21 22:34:39下载
- 积分：1
-
ListOrder
链表，输入一定的数据，通过链表进行储存，并排序后输出。(List。Input numbers,then output in order~~)
- 2011-11-24 11:02:04下载
- 积分：1
-
HEAP
poj 实现堆结构的源代码。。。话说其实没什么实际功能好么(poj achieve heap structure of the source code. . . In fact, the actual function of saying okay nothing)
- 2013-11-21 23:03:15下载
- 积分：1
-
DP
说明： 动态规划是用空间换时间的一种方法的抽象。(Dynamic programming is to use space in time a method of abstract.)
- 2012-11-12 08:52:31下载
- 积分：1
-
Circlist_Josephus3_4
循环链表的应用
循环链表的应用
很方便的实现(cycle Chain cyclic chain of convenience Implementation)
- 2006-11-23 19:36:47下载
- 积分：1
-
pinfanfangwen
设有一头指针为L的带有表头结点的非循环双向链表，其每个结点中除有prev（前驱指针），data（数据）和next（后继指针）域外，还有一个访问频度域freq。在链表被起用前，其值均初始化为零。每当在链表中进行一次Locate(L,x)运算时，令元素值为x的结点中freq域的值增1，并使此链表中结点保持按访问频度非增（递减）的顺序排列，同时最近访问的结点排在频度相同的结点的最后，以便使频繁访问的结点总是靠近表头。试编写符合上述要求的Locate(L,x)运算的算法，该运算为函数过程，返回找到结点的地址，类型为指针型。(Has a head pointer is non-circular doubly linked list L with a header node, each node in addition to prev (precursor pointer), data (data) and next (successor pointers) outside, there is an access frequency degree domain freq. Before the list was hired, their values are initialized to zero. Whenever carried out in the list once Locate (L, x) when the operation, so that the element node x is the value in freq domain by one, and keep this list in the node-access frequency of non-increasing (decreasing) the order, while a recent visit to the nodes in the same row of the frequency of the last node, so that the nodes are frequently accessed tables are always near the head. Locate (L, x) algorithm is prepared in accordance with the above requirements of the test operation, the operation as a function of the process, return to find the address of the node of type pointer.)
- 2015-01-15 22:31:59下载
- 积分：1
-
5-source--code-of-DS--PRO
数据结构课上老师布置的5个小项目的源代码，分别是汽车过河，一元多项式，迷宫，日历，BFS_DFS(failed to translate)
- 2011-05-18 17:01:17下载
- 积分：1
