-
Classic-single-linked-list
单链表是C经典数据结构算法和数据结构，希望这对大家学习有点用(Classic single-linked list data structure in C algorithms and data structures, which we hope to learn a little bit with)
- 2011-08-02 12:33:26下载
- 积分：1
-
dataStructure_yanweimin
严蔚敏的数据结构讲义
让你在学习时少走很多弯路
这可是我的珍藏版哦！！(Yan Wei-min data structure notes when you walk less in learning a roundabout that was my Special Edition Oh! !)
- 2010-09-28 15:50:00下载
- 积分：1
-
d.s.
说明： data structure objective type questions.
- 2019-05-30 13:22:31下载
- 积分：1
-
Minimax_niujiaoqi
利用极小极大算法实现简单的零和博弈；利用递归算法实现博弈树搜索的方法，并解决牛角棋问题。(Using minimal algorithm to achieve a simple zero-sum game the use of recursive algorithm to achieve the game tree search method, and solve the horns chess problem.)
- 2020-11-17 11:09:40下载
- 积分：1
-
huo-che-zui-duan-lu-jing
数据结构课程设计 求火车最短路径 题目为全国铁路最短路径经由问题
该题目采用我国铁路运输网的数据进行编程和运行验证。
(These are very important things.)
- 2021-04-03 12:29:07下载
- 积分：1
-
Internal-comparison-algorithm
系统用srand()函数产生一个以当前时间开始的随机种子。其产生的种子用选择排序、冒泡排序、快速排序将顺序表中的数字排好，设置变量记录每种排序关键字的移动次数和关键字的比较次数。选择排序：利用L.length-1个循环，将随机种子按从小到大的顺序排好。(System with srand () function generates a random seed to start the current time. Which produces seeds with selection sort, bubble sort, quick sort the order of numbers in the table lined up, set the variable record number of comparisons for each mobile number and keyword sort key. Sort: use L.length-1 cycle, the random seed small to large order lined up.
)
- 2015-03-14 12:39:38下载
- 积分：1
-
dd2
自己用c语言写的一个模块化多电平最近电平调制排序的c程序，希望对大家有帮助(Own use c language written in a modular multi-level modulation level recently sort of c program, we hope to help)
- 2014-05-21 20:19:49下载
- 积分：1
-
HuffanCoding
读取数据，统计所得到的文件中每个字母的权值，创建哈夫曼树，哈夫曼编码。哈夫曼解码，解码后内容写入到指定的文件。
读取数据里面的内容是由英文单词组成。读取文件的时候传入文件存放的路径、读取方式以及读出以后存放的数组，最终可以得到一个存放目标文件内容的数组。
将得到的数组进行字母权值的统计，统计每个字母出现的次数，次数即为每个字母的权值。
将得到的字符数组与权值数组作为创建哈夫曼树的依据，哈夫曼树根据每个字母权值的大小来创建，每个节点，包括权值、父节点、左子、右子和字母本身。
根据哈夫曼树进行编码。形成目标文件的哈夫曼编码，将此编码返回。
根据哈夫曼树得到的数组即为解码数组，解码数组作为解码的结果返回。
写入输出文件，将解码得到的数组、文件的完整路径以及文件的写方式作为参数传入，将数组写入到相应的文件中。
(Read the data, statistical documents obtained weights for each letter, create a Huffman tree, Huffman coding. Huffman decoding, the decoded contents are written to the specified file.
Read the content inside is composed of English words. When the incoming file to read the file storage path, read mode and read out after storage array that can eventually get a storage target file contents of the array.
The resulting array of letter weights statistics, statistical number of occurrences of each letter, the number is the weight of each letter.
The resulting character array with the weights array as the basis for creating Huffman tree, Huffman tree based on the size of the weights of each letter to create, for each node, including weights, parent, left child, right child, and letter itself.
According to Huffman coding. The formation of the target file Huffman coding, this code returns.
According to Huffman decoding the resulting array is an array, the decoder decodes the result is retur)
- 2020-07-02 15:40:01下载
- 积分：1
-
string
实现字符串基本上所有的功能，其中有KMP算法，有各种字符串的判别以及提取(it is really useful and wordenful)
- 2014-03-01 22:25:17下载
- 积分：1
-
sqstack
和线性表类似，栈也有两种存储表示：顺序栈和链栈。
顺序存储结构简称为顺序栈。和顺序表类似，对顺序栈也需要事先为它分配一个可以容纳最多元素的存储空间。
(and linear scale similar Stack also have two storage : order Stack and Stack chain. Sequence storage structure referred to as the sequence of stack. Table and order similar to the order Stack also needs prior to allocate it can accommodate a maximum of elements of storage space.)
- 2007-04-18 16:43:18下载
- 积分：1
