-
cycQueue
单循环链表，用C++实现
提供入队，出队，判断空等方法(Single cycle linked list, with C++ into the team, the team judge waited in vain for methods)
- 2012-10-08 20:02:15下载
- 积分：1
-
1
说明： 四路归并排序，将原有的二路归并排序改编的四路归并排序(The four-way merge sort to the original way merge sort adaptation of the four-way merge sort)
- 2012-12-07 14:16:36下载
- 积分：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
-
1
说明： 贪婪算法的简单描述 不过没做完 只是想下个程序 用用。。。。
(greed math)
- 2012-04-26 19:56:56下载
- 积分：1
-
Well-tested-algorithm
效验算法单循环链表，这些都是实用经典的算法和数据结构(Well-tested algorithm round robin list, these are practical classic algorithms and data structures)
- 2011-08-02 12:20:21下载
- 积分：1
-
qiongju
八皇后算法，用的是最简单的穷举法，在VC++6.0上编写的。(Eight Queens algorithm, using the simplest method of exhaustion, in VC++6.0 written on.)
- 2013-08-14 22:21:28下载
- 积分：1
-
c++
一款可以排序的小程序，希望大家可以看一下(A sort of small program, I hope you can look at it)
- 2017-12-13 20:06:55下载
- 积分：1
-
Hash-table
哈希表
数据结构课程设计
1.1问题描述
针对自己的班集体中的“人名”设计一个哈希表，使得平均查找长度不超过R，完成相应的建表和查表程序。
1.2基本要求
假设人名为中国姓名的汉语拼音形式。待填入哈希表的人名共有30个，取平均查找长度的上限为2。构造哈希函数，用链表法处理冲突。
1.3测试数据
读取熟悉的30个人的姓名作测试。(Hash table
Data Structure Course Design
1.1 Description of the problem
For their own class group of the "names" to design a hash table, making the average search length does not exceed R, the completion of construction of tables and look-up table corresponding procedures.
1.2 Basic requirements
Assuming the name of the person called Chinese pinyin form. To be filled into a hash table names a total of 30, taking the average search length of the upper limit of 2. Construct a hash function, treatment with a list of conflict.
1.3 Test Data
Read the familiar names of 30 individuals tested.)
- 2011-12-19 15:39:00下载
- 积分：1
-
Data-structure
说明： 分别用堆栈和数组的方法实现任何进制的数制转换(Arrays were used to stack and method of implementation of any binary number system conversion
)
- 2011-03-08 16:55:07下载
- 积分：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
