-
nuaa1108
说明: nuaa1108 多少连续的1 解题报告(Problem solving report
)
- 2009-08-23 10:01:05下载
- 积分:1
-
kaikuohaohebikuohaodepipei
开括号和比括号的匹配,数据结构内容,很不错(More than brackets and brackets to open the match, the contents of data structure)
- 2009-04-13 14:35:56下载
- 积分:1
-
yuesefu
约瑟夫问题,通过C语言对约瑟夫问题进行了分析和讲解,从而解决问题(Joseph problems, by Joseph C language issues are analyzed and explained, in order to solve the problem)
- 2011-10-26 10:56:33下载
- 积分:1
-
labyrinth
迷宫问题c源代码,大小为8*8的迷宫。主函数中输入开始位置和结束位置的坐标,输出所有可能的路径(Maze c source code, size 8* 8 of the maze. Enter the start the main function of the coordinates of the position and end position, the output of all possible paths)
- 2010-12-19 23:31:36下载
- 积分:1
-
deep-copy
该代码实现了深拷贝的问题,对于深拷贝进行了一系列的介绍,并且显示其与浅拷贝的区别。(A deep copy of the code issues a series of deep copy for presentation, and shows the difference between a shallow copy.)
- 2014-01-03 10:46:48下载
- 积分:1
-
joseph
用链表解决约瑟夫问题。
约瑟夫环是一个数学的应用问题:已知n个人(以编号1,2,3...n分别表示)围坐在一张圆桌周围。从编号为k的人开始报数,数到m的那个人出列;他的下一个人又从1开始报数,数到m的那个人又出列;依此规律重复下去,直到圆桌周围的人全部出列。
其中包括一个实验报告,介绍了编程思路和输出结果截图。(List to resolve Joseph. Josephus is the application of a mathematical problem: Given n individuals (numbered 1, 2, 3, ... n, respectively) sitting around a round table around. From number k people began to count off the number to m the man out of the line his next person and from a number off, the man was out of the line number to m so regularly repeated down until roundtable around of the people all of the columns. Including a lab report describes the programming ideas and output screenshots.)
- 2012-08-27 22:37:52下载
- 积分: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
-
heap
实现栈的基本操作,建栈,进栈,出栈,数据结构实现(To achieve the basic operation of the stack, built stack into the stack, the stack data structure)
- 2013-04-03 11:08:37下载
- 积分:1
-
listnode
C++中,对链表的增删改查的基本使用,值得学习(C++, on the list of CRUD basic use, it is worth learning)
- 2015-08-05 17:57:12下载
- 积分:1
-
list-and-array
数组的定义与使用,数组的运算,字符串的输入与输出,冒泡排序(list and array)
- 2013-10-17 11:32:30下载
- 积分:1