资源列表
SortArithemic-cf
- 自己在学习数据结构过程中，优化总结的数据结构8种经典排序算法算法源码，附带详细注释行,和各种算法的时间复杂度对比-Own data structure in the learning process, the optimization summary data structure of the eight classical sorting algorithm algorithm source code, with a detailed comment line
RadixSortTest
- 自己在学习数据结构过程中，优化总结的数据结构经典排序算法-基数排序算法源码，附带详细注释行-Own data structure in the learning process, summarize data structure optimized classic sorting algorithms- fast sorting algorithm source code, with a detailed comment line
MergeSort
- 自己在学习数据结构过程中，优化总结的数据结构经典排序算法-归并排序算法源码，附带详细注释行-Own data structure in the learning process, summarize data structure optimized classic sorting algorithms- merge sort algorithm source code, with a detailed comment line
Heap
- 数据结构经典算法之-堆排序算法源码，附带详细注释-Data structure heap sort algorithm source code
DIF
- 64点快速傅里叶变换，可同时计算逆傅里叶变换，简洁，精炼-FFT DFT IDFT
Simple-matching
- 简单算法的匹配，可以获取一长串字符串中某一小段字符串的位置-imple algorithm matching, can get a long list of a short string of a string
relation
- 输入集合和关系,转化成一个关系矩阵,并判断该关系有什么性质.有报告。-Input set and relationships into a relationship matrix, and determine what is the nature of this relationship have reported.
Mazepath
- 一个求解迷宫通路的程序。以一个M*N的长方阵表示迷宫，0和1分别表示迷宫中的通路和障碍。对任意设定的迷宫，求出一条从入口到出口的通路，或得出没有通路的结论。以链表作存储结构的栈类型非递归程序。-A path to solve the maze procedure. In an M* N' s long square maze, 0 and 1, respectively maze of paths and obstacles. For any set of the maze, find a
tu
- 分别以邻接表、邻接矩阵为存储结构，实现图的深度优先和广度优先遍历，分别输出每种遍历下的节点访问序列。-Respectively adjacent table, the adjacency matrix for the storage structure, to achieve depth-first and breadth-first traversal, respectively, each output node access under traversal sequence.
hfm
- 1.建立哈夫曼树 从终端输入字符大小n,以及n个字符和n个权值，建立哈夫曼树 2、编码 利用已建好的哈夫曼树，对输入的字符进行编码，并输出编码结果 译码：利用已建立好的哈夫曼树对输入的代码进行编码，并输出译码结果-(1) Establish the Huffman tree from the terminal input character size n, and n and n characters right value, establishes a Huffman tree
BinTree
- 以二叉树表为存储结构，实现二叉树的先、中、后三种次序的递归和非递归遍历。-Table stored in a binary tree structure to achieve binary tree before, during and after the three kinds of order recursive and non-recursive traversal.
2
- 数据结构实验，实现停车场管理操作，堆栈的使用和实现-Experimental data structure to achieve parking management operations, stack usage and implementation