-
一个有关于C++6.0与ACCESS数据库相关的小程序
一个有关于C++6.0与ACCESS数据库相关的小程序-1 on C++6.0 and the ACCESS database-related applets
- 2022-03-22 11:02:40下载
- 积分：1
-
个人信息系统
要控制我的信息系统是一个非常聪明的简单的项目。你可以学习如何添加、 更新、 删除和查询与 php mysql 语言......
- 2023-07-12 20:10:02下载
- 积分：1
-
节点不需要在链栈、1类铅，和定义…
不带头结点的链式堆栈类,1、 定义并实现不带头结点的链式堆栈类，除构造和析构函数外，成员函数还有入栈、出栈、取栈顶元素、判断堆栈是否非空，头文件为“nohead_LinStack.h”。-node does not take the lead in the category of chain stack, 1, and the definition does not take the lead in realizing the chain nodes stack category, In addition to construction and destructor function, the members also function stack, stack up and stack elements for judging whether non-empty stack, The first document as "nohead_LinStack.h."
- 2022-07-27 00:21:48下载
- 积分：1
-
数据结构作业与复习题目
数据结构作业与复习题目-data strcture homework and review
- 2022-12-21 10:30:04下载
- 积分：1
-
本人上传的是用贪心算法实现找零钱问题。贪婪算法的根本思想是逐步获得最优解。...
本人上传的是用贪心算法实现找零钱问题。贪婪算法的根本思想是逐步获得最优解。-I uploaded is to use greedy algorithm to find small change problem. Greedy algorithm is the fundamental idea is to gradually get the optimal solution.
- 2022-03-02 15:39:29下载
- 积分：1
-
A source of commercial software, including databases, graphics and other operati...
一个商业软件的源码，含数据库，图形等多种操作-A source of commercial software, including databases, graphics and other operating
- 2022-02-03 08:59:00下载
- 积分：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
-
achieved using the binary tree traversal sequence which read and storage, will b...
用c实现的二叉树的中序遍历的读取与存储，能体现出向左倒的二叉树的打印界面，界面简单。-achieved using the binary tree traversal sequence which read and storage, will be shown left one of the binary tree Print interface that simple.
- 2023-05-12 02:45:03下载
- 积分：1
-
霍夫曼编码前缀编码Huffman Coding
霍夫曼编码前缀编码Huffman Coding-Huffman Codeing
- 2022-04-27 08:54:46下载
- 积分：1
-
tour of the campus code extremely Note
校园导游的代码极其说明-tour of the campus code extremely Note
- 2023-02-11 02:10:04下载
- 积分：1
