-
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
-
a good staff training system
一个不错的员工培训系统-a good staff training system
- 2022-09-09 02:20:02下载
- 积分：1
-
Latest noi2099 problem
最新noi2099解题报告.包含源程序.标注以及解答.-Latest noi2099 problem-solving report. Contains source. Callout and answer.
- 2022-09-17 16:45:03下载
- 积分：1
-
CShap代码
冒泡排序，选择排序，插入排序，希尔排序
算法
CShap代码
冒泡排序，选择排序，插入排序，希尔排序
算法-Code CShap Bubble Sort, Selection Sort, Insertion Sort, Hill sorting algorithm
- 2022-03-23 02:49:27下载
- 积分：1
-
MultifunctionalCalculator
基于MFC平台，实现多功能计算器，可求解复杂表达式，主要实现为数据结构中链表和数组，对于要熟悉链表和数组的初学者有很帮助。(Based on the MFC platform, to achieve multi-function calculator, can solve complex expressions, the main realization of the data structure for the list and array, to be familiar with the list and the array of beginners helpful.)
- 2016-10-04 13:20:37下载
- 积分：1
-
1
说明： 数据结构中的顺序表，是其中的一个重要组成部分(The order of the table data structure is an important component of which)
- 2011-05-06 14:34:13下载
- 积分：1
-
c4.5matlab
说明： c4.5 关于决策树decision tree的matlab实现程序 (c4.5 decision tree decision tree on the realization of the matlab program)
- 2008-12-08 15:21:49下载
- 积分：1
-
用pascal实现寻找最近点对问题，以方便对pascal较熟悉的学习者参考。...
用pascal实现寻找最近点对问题，以方便对pascal较熟悉的学习者参考。-used to find the nearest point on the issue, to facilitate the pascal more familiar reference learners.
- 2022-03-25 14:18: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
-
Huffman
霍夫曼编码实验报告，内含源代码，编码原理
(Huffman coding lab report, containing the source code, coding theory)
- 2011-06-04 20:44:25下载
- 积分：1
