网站首页

登录

Hash-table

于 2011-12-19 发布文件大小:124KB

 0  372

下载积分: 1 下载次数: 10

我要下载

代码说明：

哈希表数据结构课程设计 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.)

文件列表：

Hash table.doc,207360,2011-12-19

下载说明：请别用迅雷下载，失败请重下，重下不扣分！

发表评论

0 个回复

PRIM
PRIM算法对任意给定的网和起点，用PRIM算法的基本思想求解出所有的最小生成树。(PRIM algorithm for any given network and the starting point, PRIM algorithm used to solve the basic idea of all the minimum spanning tree.)

2009-01-11 19:05:21下载

积分：1
dijkstra
dijkstra算法，用于寻找已建立图的最短路径，是非常有用的一个算法(Dijkstra algorithm, has been established for finding the shortest path map is a very useful algorithm)

2007-07-15 14:14:48下载

积分：1
exchange
这是一个二叉树左右子树交换的简单程序，希望对大家有用！(This is a binary tree so the simple sub-tree exchange procedures in the hope for all of us!)

2009-10-16 21:02:19下载

积分：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
BinarySortTree
二叉排序树，可以实现插入，删除，查找，创建功能(Binary sort tree,you can achieve the insert,delete,search,create functional)

2009-12-03 10:53:04下载

积分：1
stuctures
本系统采用C语言编写，利用邻接链表实现最短路径问题，关键路径问题等(The system uses the C language, using adjacency list realize the shortest path problem, critical path issues)

2008-05-29 21:11:26下载

积分：1
Strassen-code
思塞恩算法常用算法之一算法导论提及(strassen algorithm which can run correctly)

2014-11-28 14:33:16下载

积分：1
ANT
A*算法通过启发式探索下一结点，逐步逼近目标结点，且使得路径最短。(A* algorithm heuristic to explore the next node, and gradually approaching the target node, and that the shortest path.)

2012-05-17 09:14:21下载

积分：1
a
说明：进程死锁.资源分配图的绘制 建立所需数据结构；  使用题目21存成的资源分配图的文件作为输入；  编写资源分配图化简算法；  每化简一步，在屏幕上显示化简的当前结果；  最后给出结论，是否死锁，如思索给出死锁的进程及资源； (Process deadlock. Resource allocation mapping  establish the required data structures  Use title 21 deposit into resource allocation graph file as input  writing resource allocation map simplification algorithm  Each simplification step, on-screen display simplification of the current result  Finally, the conclusion of a deadlock, deadlock is given as thinking processes and resources )

2013-07-04 19:50:58下载

积分：1
Kruskal
采用Kruskal算法求最小生成树主要数据结构 edgeset GE 存放图中的所有边 int n,int e 存放图中的顶点数与边数 edgeset C 存放生成树中的边 vexlist gv 图中结点的顶点值 adjmatrix s 用来处理图中结点的查找与合并 int m1,m2 一条边上两顶点所属集合的序号 int k 最小生成树中的边数 int d //图中待扫描边元素的下标(For the Minimum Spanning Tree by Kruskal main data structures edgeset GE store all edges in the figure int n, int e store graph vertices and edges edgeset C storage spanning tree edges in the vexlist gv graph node vertex values adjmatrix s used to process graph node to find and merge int m1, m2 an edge belongs to the set number two vertices int k minimum spanning tree edges int d // figure to be Scan edge element subscript)

2011-05-17 10:22:56下载

积分：1

696516资源总数
106914会员总数
0今日下载