资源列表
changesort
- 交换法比较简单，在一组数据中每次用当前的元素同后面的元素比较并在符合条件时交换。直到该组数据是从小到大的序列-Exchange method is relatively simple, in one set of data in each element with the current elements in comparison with the back and in line with the conditions of the exchange. Until the data are
speedsort
- 快速排序是选一个中间值，程序中使用中间值，然后把比它小的数据放在左边，大的数据放在右边。两边分别递归这个过程。-Quick Sort is the election of a middle value between the value of the use of the procedure, and then put it smaller than the data on the left, the data on the right side. Recursive separately on
choosesort
- 选择法排序是从数据中选择最小的同第一个值交换，再从剩下的部分中选择最小的与第二个值交换，这样循环下去，直到循环结束。-Selection method to sort the data selection from the smallest value with the first exchange, and then the remaining part from the selection with the second smallest value of the exchange, so
Bubblesort
- 冒泡法排序是在一组数据中依次比较相邻的两个元素，如果相邻的两个元素是逆序，改变其顺序，循环若干遍，直到数据是从小到大的排序。-Bubble sort method are at a group of data followed by comparison of the two adjacent elements, if two adjacent elements are in reverse, to change its order, the cycle several times until
MaxCommanSubsequence
- 求最长公共子序列的算法，其中包含了对该算法的讲解。-For the longest common sub-sequences algorithm, which includes explanation of the algorithm.
zjuacm
- 自己AC的zju_acm上的若干个题目,都是自己辛辛苦苦AC的。-some answers of Zhejiang University ACM questions
DataStructure(CSharp)
- 将数据结构与C#语言和.NET框架结合是本书的一大特点。.NET平台是微软推出的一个新的开发平台，目的是让“不同的语言共享同一平台”。.NET很可能成为下一代Windows操作系统的一部分。而C#语言作为新一代完全面向对象的语言，是.NET的母言。本书所有的数据结构和算法都是用C#语言进行描述，并在相应章节的末尾介绍了在.NET框架中常用的数据结构和算法。用C#在.NET平台开发的技术人员可以从本书中获得许多有益的知识和技术。-Data structure and C# language and
Banker
- 银行家算法
huff
- 数据结构上机报告－huffman。内有详细的需求分析及、源码及测试结果。高质量！-Data structure report on machine-huffman. Inside there is a detailed needs analysis and, source code and test results. High quality!
Strassen
- 调用随机函数输入2个矩阵，并用Strassen矩阵乘法和普通的矩阵乘法计算2个矩阵的乘积，并且记录程序运行时间作比较。 -Call the random function input 2 matrix, and matrix multiplication and Strassen matrix multiplication calculation ordinary matrix product of two, and run-time recording procedures for com
JosephRing
- 约瑟夫环，学数据结构的很值得好好研究的算法。包含实验报告。-Joseph Wan, the data structure of the study is worth a good study of algorithms. The report contains the experiment.
Binarytreeforthewidth
- 求二叉树中的宽度 二叉树中具有结点数最多的那一层结点总数即是二叉树的宽度。可以采用分层遍历的方法求出所有结点的-Binary tree for the width of tree nodes with the largest total number of nodes that a layer that is the width of tree. Layered traversal can be used to derive all the way to node