-
migong
迷宫算法,1代表可以通过,0代表墙壁,自动找寻路线(Maze algorithm, 1 can pass 0 for the walls, automatically find routes)
- 2011-06-11 17:13:39下载
- 积分:1
-
class
给定m个n维向量a , a , ,am 1 2 ,向量分类问题要求将相同的向量划分为同一类。试用
抽象数据类型表设计解向量分类问题的有效算法。(Given m a n-dimensional vector a, a,, am 1 2 )
- 2008-05-05 22:03:41下载
- 积分:1
-
classical-algorithm-VCPP
常用的算法经典代码,包括快速排序,冒泡排序等各种排序方法,还有二叉树的前序、中序和后序遍历等(The classic algorithm code, including quick sort and bubble sort sorting methods, as well as the preamble of the binary tree, inorder and postorder traversal, etc.)
- 2013-01-15 11:15:10下载
- 积分:1
-
KMP
说明: KMP算法的具体实现,能够在O(n+m)时间内找出字串在父串中的位置,n为父串长度,m为字串长度(KMP in the proposed algorithm, can be O (n+ m) time to find the string in the parent string position, n the parent string length, m for the string length)
- 2010-04-28 16:18:00下载
- 积分:1
-
8queen
此程序用于解决8皇后问题,运行后输出8皇后问题的所有解(This program is used to solve the 8 queens problem, all solutions of 8 queens problem output operation.)
- 2013-05-06 21:15:23下载
- 积分:1
-
hamidunp2Boulatu
关于中国邮递员的解决办法,个人觉得还不错的说(Chinese postman)
- 2012-06-10 17:28:15下载
- 积分: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
-
tcpip
以太网首部的一个c语言程序,代码功能是对设备要传送的帧进行排队(Ethernet header c language program code function is queued frames to be transferred to the device)
- 2013-03-26 11:49:23下载
- 积分:1
-
DBSCAN
数据挖掘中聚类算发中基于密度的算法DBSCAN(Hair count data mining clustering algorithm DBSCAN density-based)
- 2011-09-29 09:53:45下载
- 积分:1
-
fast_sort
/*快速排序:以待排序元素中的第一个元素作为基准将带排序的元素分为三组
*大于基准元素为一组置于基准值的右边,小于基准值的元素为一组置于基准值的左边,
*基准值为一组,这样就找到了基准元素的位置就确定了
*如此递归调用。直到每一组的low==high,即实现了排序的要求。
*/
(/* Rapid Sort: the first element to be sorted in the element as a basis with with sorting the elements are divided into three groups* is greater than the reference element of a group is placed on the right side of the reference value, smaller than the reference value elements for a group of placed on the left side of the reference value,* reference value, a group, so that the location of the reference element is found it is determined* so recursive call. Until each group of low == high to achieve the requirements of the sort.* /)
- 2012-10-26 21:42:43下载
- 积分:1