资源列表
sort
- 该算法主要实现了归并排序和快速排序，并对两种排序算法的效果进行比较，主要计算排序所需时间，据此判断哪种算法更快-The algorithm implements merge sort and quick sort, and the effects of two sorting algorithms are required to spend more time, the main calculation sort, to judge which algorithm faster
diagonal-matrix
- 一个对角矩阵，有如下共享成员，输入、输出、加减乘、转置等函数。结果都是一个用一位数组表示的对角矩阵。重载运算符<<,>>,+,-和*。-A diagonal matrix, there are shared members, input, output, subtraction multiplication, transpose and other functions. The result is an array represented by a diagonal ma
Matrix
- 把一个N*N的三角矩阵按列的方式映射到一个3N*2的一维数组，功能设置，输入输出、存储搜索、加减乘、转置。-Put an N* N triangular matrix is mapped to the column by way of a one-dimensional array of 3N* 2, the feature set, input and output, storage, search, add and subtract multiply, trans
C-Matrix
- C-矩阵，除去第一行、第一列、最后一列外都为0.这样一个C-矩阵可以压缩存储为一维数组，先逐行再第一列的顺序。并且支持存储搜索功能。-C-matrix, removing the first row, first column, the last column are zero outside, so a C-matrix can be stored as a compressed one-dimensional array, then the order of the first column
sparse-matrix
- 一个稀疏矩阵，按照列主次的顺序存储到一维数组中，支持存储和搜索。-A sparse matrix, primary and secondary storage in the order listed to a one-dimensional array, support storage and search.
Josephus
- 对任意输入的n和m，求出最后剩下的人的编号。要求利用线性表保存这n个人，分别用公式化、链接、模拟指针三种描述方法实现。 输入：input.txt，两个整数n（3－100），m（1－m）-N and for any input m, the remainder of the determined number of the last. This requires the use of a linear table holds n individuals, respectively formul
2chashu
- 最简单易学的二叉树例子，适合刚开始接触数据结构的同学！-The simplest example of a binary tree to learn, just getting started with a data structure suitable for the students!
conversion
- 数据结构的简单应用来实现数制转换，利用链式结构实现栈。-Simple application data structures to achieve number system conversion, the use of chain structure to achieve stack.
Address-Book
- 数据结构最经典的应用例子—通信录的实现。利用了链式结构的链表，适合开始接触数据结构的同学-Application data structure classic example- recorded communications implementation. Students take advantage of the chain structure of the list for getting started with data structures
1-1
- 一本书的页码从自然数1开始顺序编码直到自然数n。书的页码按照通常的习惯编排，每个页码都不含多余的前导数字0。例如第6页用6表示而不是06或006。数字统计问题要求对给定书的总页码，计算出书的全部页码中分别用到多少次数字0,1,2,3,.....9。-A book page from the coding sequence of natural numbers starting at 1 until the natural number n. Book page layout according
pajek_vgr
- 将复杂网络连边关系转换为.vgr格式，以便导入pajek进行拓扑结构分析-The complex network of relationships even convert edge. Vgr format to be imported topology analysis pajek
Sorts
- 七种常用的排序方法：冒泡排序，直接插入排序，直接选择排序，希尔排序，归并排序，快速排序和堆排序。 在DEV C++上可运行-Seven Sort Algorithm, including BubbleSort, InsertSort, SelectSort, ShellSort, MergerSort, QuickSort, HeapSort.