-
Anorldi
关于Arnoldi算法的今年来的中文资料,希望能够给有兴趣编写这方面算法的人提供帮助(Arnoldi algorithm on the Chinese data this year, hoping to write this algorithm are interested in helping people)
- 2011-10-22 10:26:34下载
- 积分:1
-
Joseph
说明: 约瑟夫问题,四种解法,分别是静态链表,顺序表两种和循环链表(Joseph problems, the four solution, namely a static list, order form and the cycle of two lists)
- 2010-04-23 08:20:53下载
- 积分:1
-
yuesefuhuan
使用VC编写的约瑟夫环程序,简单明了,方便使用(Prepared using the VC Joseph Central program, simple and clear, easy to use)
- 2009-09-08 16:45:26下载
- 积分:1
-
kalman_C
说明: 离散随机线性系统的卡尔曼滤波。
其中13lman.c是卡尔曼滤波函数,4rinv.c是滤波函数中用到的矩阵求逆函数,13lman0.c是主程序。(discrete stochastic linear Kalman filtering system. 13lman.c which is the Kalman filter function, 4rinv.c filtering function is used in the matrix inversion function, is the main program 13lman0.c.)
- 2006-03-01 19:20:13下载
- 积分:1
-
bubblesort
这个是关于数据结构中冒泡排序算法的实现,大家可以利用这个为基础,进一步研究和利用排序(This is a data structure on the Bubble Sort algorithm, we can use this as a basis for further study and use of sorting)
- 2009-01-14 23:37:37下载
- 积分:1
-
lab07
本例主要设计查找的有关算法,例如有序表的查找和顺序标的查找,顺序查找、折半查找及二叉排序树上查找的基本思想和算法实现等。(In this case mainly designed to find the relevant algorithm, such as an ordered list of the find and order the subject to find, sequential search, binary search and binary sort tree to find the basic idea and algorithm.)
- 2013-05-12 22:01:58下载
- 积分:1
-
binary-search
此代码为折半查找算法,适用于有序表,欢迎各位下载(This code is the binary search algorithm for ordered lists
)
- 2011-07-06 15:50:17下载
- 积分:1
-
ACRush_2_1
这是acm高手楼天城的比赛代码,很有用哦,对于提高算法非常有用(This is a master of building Tiancheng acm game code, very useful oh, for improving the algorithm)
- 2011-06-16 21:00:05下载
- 积分:1
-
GraphTheory
讲述数据机构的图论部分和程序设计的关系,适合学习算法的同学学习阅读,很不错的一本书。(Graph theory algorithm and programming)
- 2013-12-04 20:12:39下载
- 积分: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