-
radixsort
对首先产生20个随机数进行基数排序,是利用C++实现的(On the first 20 random numbers generated for the base sequencing is the use of C++ Realize the)
- 2007-10-16 19:11:53下载
- 积分:1
-
LinkNode
这个是C++编译的单链表,其中包括多种链表操作,是很好的学习资料。(This is a C++ compiler single linked list, which includes a variety of linked list operations, is a good learning materials.)
- 2012-09-24 17:22:21下载
- 积分:1
-
kaikuohaohebikuohaodepipei
开括号和比括号的匹配,数据结构内容,很不错(More than brackets and brackets to open the match, the contents of data structure)
- 2009-04-13 14:35:56下载
- 积分:1
-
jhgrerfgjz
一个简单的求矩阵求逆的c语言算法
一个简单的求矩阵求逆的c语言算法
一个简单的求矩阵求逆的c语言算法(a simple matrix inversion for the C language algorithms for a simple matrix inversion of the c language a simple algorithm The matrix inversion for the C language algorithms for a simple matrix inversion algorithm in C Language)
- 2021-03-29 11:39:11下载
- 积分:1
-
MyKD Tree
KD树算法,能够实现对点云数据进行压缩,非常简单,适用于初学者(KD tree algorithm, can achieve the point cloud data compression, very simple, suitable for beginners)
- 2015-06-24 20:10:33下载
- 积分:1
-
ahuangCD
这个是数据结构课程设计中阿黄的CD的程序代码的工程文件包(This is a data structure curriculum design A yellow CD program code works package)
- 2013-12-21 18:53:00下载
- 积分:1
-
hafumanTree
数据结构课程设计,在VC环境下完成,利用哈夫曼树原理,主要功能是实现字符的压缩和解压缩,设计脉络清晰,易懂(Data structure course design, completed in the VC environment, using Huffman tree principle, the main function is to achieve the character of the compression and decompression, design, clear structure, easy to understand)
- 2011-01-02 13:15:23下载
- 积分:1
-
examples-of-data-structure
吴伟民版数据结构每个算法的c实现方法,并模块化处理,将各个功能分开编程,有助于移植使用(failed to translate)
- 2013-05-06 13:20:48下载
- 积分:1
-
LINK
建立链表的算法:
新节点链入表尾建立链表:
动态分配第一个节点变量;
用指针head 妥善保存链表第一个节点的地址值;
依次动态分配一个新节点变量;
将上一个节点的指针域指向新生成的节点;
循环3),4)步骤,直到所有节点均连入链表;
将最后一个节点的指针域赋值为0;
(Establish the list of algorithms:
The new node links footer build list:
Dynamic allocation of the first node variable
Keep the list head pointer of the first node address value
In order to dynamically allocate a new node variable
The domain of a node pointer to the new generation of nodes
Cycle 3), 4) step, until all nodes are connected to the chain
Pointer field will last node assigned to 0 )
- 2015-01-05 16:03:48下载
- 积分:1
-
9
说明: 任意给定输入的一个小写英文字符串a1a2a3…an-1an (n≥5)
输出:字符串Ana1An-1a2An-2a3…A2an-1A1an,其中Ai为ai的大写形式
例如,输入aybdx,则递归程序输出XaDyBbYdAx
(Any given input of a lowercase string a1a2a3 ... an-1an (n ≥ 5) Output: the string Ana1An-1a2An-2a3 A2an-1A1an, which Ai ai uppercase for example, input aybdx recursive program output XaDyBbYdAx)
- 2012-05-30 10:59:39下载
- 积分:1