-
results for use, is a curriculum design
成绩查询使用，是个课程设计-results for use, is a curriculum design
- 2022-03-05 20:21:41下载
- 积分：1
-
哈夫曼树和哈夫曼编码：
从终端输入若干个字符及其对应的整数，将整数作为结点的权值，建立哈夫曼树，然后对各字符进行哈夫曼编码。最后打印哈夫曼树和对应的哈夫曼编...
哈夫曼树和哈夫曼编码：
从终端输入若干个字符及其对应的整数，将整数作为结点的权值，建立哈夫曼树，然后对各字符进行哈夫曼编码。最后打印哈夫曼树和对应的哈夫曼编码。
设计要求：
⑴ 哈夫曼殊和哈夫曼编码的存储表示参考教材事例
⑵ 在程序中构造四个子程序为
① int createhtree(HTree *t) /*根据输入的字符及其权值建立哈夫曼树*/
② void coding(HTree *t, char *code) /*对哈夫曼树进行编码*/
③ void printhtree(HTree *t, int* path) /*中序打印树*/
④ void printcode(HTree *t) /*输出个字符的哈夫曼编码*/
-Huffman tree and the Huffman coding: input from the terminal a number of characters and their corresponding integer, will be an integer as node weights, the establishment of Huffman tree, and then on the characters Huffman. Finally print Huffman tree and the corresponding Huffman. Design requirements: ⑴ Huffman and Huffman coding is that the reference materials storage ⑵ examples constructed in the procedure for the four subroutines ① int createhtree (HTree* t)/* input characters in accordance with its right value the establishment of Huffman tree*/② void coding (HTree* t, char* code)/* Huffman tree to encode*/③ void printhtree (HTree* t, int* path)/* Pri
- 2022-01-22 06:46:42下载
- 积分：1
-
fibonacci-heap
斐波那契堆是一种具有较好平摊时间的堆数据结构。我使用C语言来实现斐波那契堆。(Fibonacci heap is a heap of time with good flat data structure. I am using C language to implement Fibonacci heap.)
- 2013-09-17 18:02:59下载
- 积分：1
-
shujuyuchuli
统计数据的预处理源程序大全，数据的平滑处理，数据的标准化转换，数据的极差归一化变换(Daquan source of statistical data pre-processing, data smoothing, standardization of data conversion, data conversion of poor normalization)
- 2011-08-08 21:10:37下载
- 积分：1
-
outline
哈希表函数,纯C语言编写的哈希表计算函数(Hash table functions, written in pure C language function to calculate the hash table)
- 2013-12-02 14:42:14下载
- 积分：1
-
清华大学类数据结构实现的乙
清华大学数据结构课上实现的B+树，设计一个4阶B+树，包括： (1) 叶子的每个记录应该包括4字节（long）关键码值和60字节的数据字段(存储文件名等，可以自定)，设每个叶子可以存储5条记录，而内部节点应该是关键码值/指针对。此外，每个节点还应该有指向同层下一个节点的指针、本节点存储的关键码数等； (2) 此4阶B+树应该支持插入、删除以及根据给定关键码值进行精确检索与关键码范围检索； (3) 显示（打印）此4阶B+树的生长(含删除节点)过程实例；-Tsinghua University class data structure to achieve the B-tree, the design of a B-tree four bands, including : (a) the leaves of each record should include 4-byte (long) key code value and 60 gigabytes of data fields (document storage, etc., can be set), set up each leaf store five records, and internal nodes is the key code value/means against. In addition, each node should have the same point under a layer of the target node, the node storage key code number; (2) The B-tree four bands should support the insertion, deletion and with the given key code value accurate retrieval and key codes scope retrieval; (3) Display (Print ) This four bands B-tree growth (including the deletion of nodes) process examples;
- 2022-01-21 19:44:41下载
- 积分：1
-
Page
页式管理缺页中断优化FIFO LRU OPT.rar 三种算法-Page-style management page fault FIFO LRU OPT.rar three kinds of optimization algorithms
- 2022-09-15 20:05:03下载
- 积分：1
-
表达式求值是程序设计语言编译中的一个最基本问题，它的实现是栈的应用的典型例子。...
表达式求值是程序设计语言编译中的一个最基本问题，它的实现是栈的应用的典型例子。-Expression evaluation is a programming language compiler in a fundamental question, and its implementation is a typical example of the application stack.
- 2022-01-22 04:05:49下载
- 积分：1
-
在二维的AVL树的显示格式
AVL tree display format in two dimensional
- 2022-01-26 06:26:12下载
- 积分：1
-
Huffman
数据结构，利用霍夫曼树实现文本数据的压缩。(Huffman data compression and decompression.)
- 2014-01-28 18:25:24下载
- 积分：1
