-
中南的数据结构试验1
中南的数据结构试验1-Indochina data structure a test
- 2022-01-23 10:51:20下载
- 积分:1
-
新收集的客户管理软件
新收集的客户管理软件-new collection of customer management software
- 2022-08-13 08:30:03下载
- 积分:1
-
从文件中读入的数据来计算全班平均性能…
从文件里读入数据,计算各课成绩的平均分,最高分,最低分,学生的加权平均成绩,并生成分析数据。-Reading from the document into the data to calculate the class average performance, the maximum points, minimum points, the weighted average performance of students, and generate analytical data.
- 2022-08-11 05:56:46下载
- 积分:1
-
遍里数据库集合里的数据
遍里数据库集合里的数据-times database, the data pool
- 2022-10-03 06:50:03下载
- 积分:1
-
进制转换
这个源代码是二进制,八进制,十进制数字之间的互相转换。
- 2022-07-17 19:46:59下载
- 积分:1
-
哈夫曼树算法
根据给定的n个权值{w1,w2,……wn},构造n棵只有根结点的二叉树,令起权值为wj
在森林中选取两棵根结点权值最小的树作左右子树,构造...
哈夫曼树算法
根据给定的n个权值{w1,w2,……wn},构造n棵只有根结点的二叉树,令起权值为wj
在森林中选取两棵根结点权值最小的树作左右子树,构造一棵新的二叉树,置新二叉树根结点权值为其左右子树根结点权值之和
在森林中删除这两棵树,同时将新得到的二叉树加入森林中
重复上述两步,直到只含一棵树为止,这棵树即哈夫曼树
-Huffman tree algorithm based on a given n-weights (w1, w2, ... ... wn), construct n trees only a root node of the tree, so that from the right value of wj in the forest root node to select two the right tree for the value of the smallest subtree around, a new binary tree structure, the right to buy a new tree root node value of its subtree root node around the right value in the forest and delete these two trees, At the same time, the new binary tree obtained by adding the forest to repeat the above two steps until a tree containing only the date, that is, Huffman tree tree
- 2023-05-05 13:05:03下载
- 积分:1
-
回文算法实现,代码已经验证
回文算法实现,代码已经验证-Palindrome algorithm, code validation
- 2023-06-27 21:05:03下载
- 积分:1
-
SSD7练习1
ssd7的本人的答案, 供大家参考, 希望大家喜欢-ssd7 exercise1
- 2022-03-20 18:34:57下载
- 积分:1
-
C++ Builder程序员学习数据结构第3章
C++ Builder程序员学习数据结构第3章-Builder C programmers to learn data structure Chapter 3
- 2022-03-16 16:07:27下载
- 积分:1
-
本代码经过验证,绝对可以运行,并附有解析,对初学者有很大帮助...
本代码经过验证,绝对可以运行,并附有解析,对初学者有很大帮助-Verified the code and it can definitely run with a resolution, has great help for beginners
- 2022-08-08 00:09:26下载
- 积分:1