资源列表
sort-work
- alot of sorts codes : bubble sort binary sort merge sort quick sort etc.
tongxunlu
- 本程序中主要是利用了和链表相关的知识实现了类似电话簿一样的功能，并能删除、保存等功能。对想了解链表的有比较好的帮助。-Mainly used in this procedure and the list of the relevant knowledge to achieve a similar phone book function, and can delete, save and so on. On the list would like to know there are good he
doublelist
- 双链表的有关程序，包括插入数据，删除数据。-Double-linked list of the relevant procedures, including inserting data, deleting data.
C-Common-algorithm---Set
- 一个C语言常用算法集，里面会有你用得着的算法，错误之处，请君等自己修正后在使用。-A set of C language commonly used algorithm, which algorithm will you need it, mistakes, inviting the use of their own, such amendments.
HaffmanCode
- 哈弗曼编码 暑期课程设计作业，c++开发，输入字母串后，对个字母编码以及译文显示，动态演示哈弗曼树的生成-Ha Fuman summer curriculum work coding, c++ development, the input letter string, the translation of the letter codes and show that the generation of dynamic display Hafu Man Tree
cSharp-data-structure
- 将数据结构与C#语言和.NET框架结合是本书的一大特点。本书所有的数据结构和算法都是用C#语言进行描述，并在相应章节的末尾介绍了在.NET框架中常用的数据结构和算法。用C#在.NET平台开发的技术人员可以从本书中获得许多有益的知识和技术。-Data structures and C# language and. NET Framework with a major feature of this book. Book all the data structures and algorithms
zzjz
- 利用三元组转置矩阵，三元组为矩阵的一种数据结构，三元组为一种特殊的矩阵存储方式。-Transposed matrix using triples, triples as a data structure for the matrix, triples as a special matrix storage.
tuopupaixu
- 此为拓扑排序算法，拓扑排序是网络中的确定逻辑先后顺序的一种算法，要求网络中没有回路-This is the topological sort algorithm, the network topology in order to determine the logical order of an algorithm that requires no loop network
BinaryTree
- 创建二叉树类。二叉树的存储结构使用链表。 提供操作:前序遍历、中序遍历、后序遍历、层次遍历、计算二叉树结点数目、计算二叉树高度。 -Create a binary tree class. Binary tree using linked list storage structure. Provides operations: pre-order traversal, inorder traversal, postorder traversal, traverse levels to ca
4-4
- 将编号为0和1的两个栈存放于一个数组空间V[m]中，栈底分别处于数组的两端。这种双栈结构的类定义，并实现判栈空、判栈满、插入、删除算法。-Will be numbered 0 and 1 array of two stacks placed in a space V [m], the stacks were in the bottom ends of the array. This dual-stack structure of class definitions, and to achieve
3-3
- 两个带表头结点的非递减有序单链表的表头指针, 将这两个有序链表合并成一个非递增有序的单链表。要求结果链表仍使用原来两个链表的存储空间, 不另外占用其它的存储空间。-Header node with two non-decreasing ordered list of single-table pointer, the two ordered lists into one single list of non-incremental and orderly. The results are sti
2-2
- 求解Josephus问题的函数。用整数序列1, 2, 3, ……, n表示顺序围坐在圆桌周围的人，并采用数组表示作为求解过程中使用的数据结构。-Josephus problem solving functions. With a sequence of integers 1, 2, 3, ... ..., n that order around a round table around and use that as an array of data used in the process of