资源列表
Merge-sort
- 一个归并排序函数代码，用归并的思想对某一数组进行排序，可以被直接调用来使用-A merge sort function code, by merging thought of a sort an array, can be called directly to use
Binary-tree
- 二叉树的各种算法，包括二叉树的创建，插入，删除，求深度等-A variety of binary tree algorithm, including the creation of a binary tree, insert, delete, and depth，and so on
Huffman-tree
- 利用静态链表建立赫夫曼树，建树过程中左子树权值小于右子树权值，求各结点的编码。叶子结点的个数n及结点值由键盘录入-Using static linked list to establish a Huffman tree, set during the process of weight less than the right subtree subtree weights, and each node coding. Leaf node of the number N and node valu
Depth
- 实现图的邻接表存储结构及一些基本操作函数。在此基础上实现图的深度遍历算法-The realization of graph adjacency list storage structure and some basic operation function. On the basis of the realization of graph depth-first traversal algorithm
Breadth
- 使用图的深度遍历实现的邻接表存储结构和基本操作函数，在此基础上实现图的广度遍历算法-The use of graph traversal depth achieve adjacency list storage structure and basic operation function, on the basis of the realization of graph breadth traversal algorithm
Binary-Tree
- 源代码实现了二叉树的遍历以及输出。直接可以运行，代码完整。-Binary Tree
Binary-Tree(new)
- 源代码实现了二叉树的遍历以及输出。直接可以运行，代码完整。-Binary Tree
BinaryTree-Positive-sequence
- 二叉树的正序建立。代码完整，可直接运行。-BianryTree Positive sequence
The-shortest-path-bellman-ford
- 在实际问题中，边的权值一般以正权的形式出现，但是很多情况下负权也是存在的。这个时候，最短路径不一定存在。我们无法得到像dijkstra算法那样时间复杂度较低的算法，但是，仍然可以用bellman-ford迭代算法去解决问题。 bellman-ford算法是迭代算法，它不像dijkstra算法，按照一定的顺序直接算出每个点的距离值，而是不断地修改每个点的当前最小距离值，直到求出真正的最短距离为止。 -In practical problems, the edge weight is gen
Cxiaoshou
- 使用C语言编写的销售员每月销售额的统计量，对销售额进行对比。-Salesperson using C language monthly sales statistics, the sales compared.
graph
- 能实现图的基本操作，本是数据结构图那一章的一次作业-this is a small program.It can do some basic operation about graph.
sf
- 实用算法的分析与程序设计 算法好书 对初学者很有帮助-Practical algorithm analysis and programming algorithm for beginners good books to have the help very much