搜索资源列表
三种模式匹配算法的比较
- Las Vegas，KMP，Mentro carlo这三种模式匹配算法的原代码，对其进行了时间及出错率的比较-Las Vegas, KMP, Mentro carlo three pattern matching algorithm of the original code, its time and the error rate comparison
minheap vs minleftisttree
- 这是一个用C++编写的代码,实现了最小堆和最小左偏树在插入删除元素性能方面进行比较. -This is a preparation of the C code, the smallest and youngest sculpture tree in the left side inserted delete elements performance comparisons.
inordervisit
- 该程序完成对二叉树的非递归中序遍历，因为其中涉及到二叉树的构造，而且使用类来构造，所以代码比较多。-completion of the process of non - recursive binary tree which preorder because it involved the construction of a binary tree, but the use of class structure, the code more.
操作矩阵的类 CMatrix
- 一个操作矩阵的类CMatrix的算法，代码比较长，但是时间复杂度不是很高，所以个人觉得还算是个合格的该类算法代码-an operational matrix of categories CMatrix algorithm, code rather long, but time complexity is not very high, so personally think that this was a qualified source of such algorithms
45663
- 图的最小生成树 自己写的 代码比较简介 功能还可以-Minimum Spanning Tree
ACM
- 吉林大学计算机科学学院2005年制作的ACM/ICPC代码库，里面的代码比较详细，清晰-Jilin University School of Computer Science in 2005 production of ACM/ICPC code base, which code for more detailed, clear and
job
- C/C++模拟系统作业调度。代码比较简单。还可以。-C/C++ simulation system for job scheduling. The code is relatively simple. Okay.
primkruskal
- 用克鲁斯卡尔（kruskal)算法求N个结点所联成的加权无向图的最小生成树，核心代码比较简单。-Using Kruskal (kruskal) algorithm to solve the N nodes are linked to form a weighted undirected graph of the minimum spanning tree, the core code simple.
Stackwitharray
- 适合初次学习数据结构的同学，代码比较简单希望与大家分享-Data structure for students to learn first, the code is relatively simple wish to share with you
threeOrder
- 数据结构中三种遍历方式的小程序，代码比较简单易懂-Three traversal data structure of small programs, the code is relatively simple to understand
DDA
- 实现直线的DDA算法，程序代码比较简单，操作方便-Realize the lines of the DDA algorithm, and the program code is simple, easy to operate
maze
- 用VC6.0编写的生成和求解迷宫的程序，利用堆栈实现，代码比较简单，可以用来参考。-Written by VC6.0 generate and solve the maze procedure, and use the stack, the code is relatively simple, can be used to refer to.
EightQueensProblem
- 这是一个古老的问题，有关八皇后的问题，代码比较短，但是有回溯的思想-This is an old problem, the eight queens problem, the code is relatively short, but the idea back
The-shortest-path
- 用Dijkstra算法和Floyd算法实现最短路径，代码比较详细。-To realize the shortest path
Eight-queens-problem
- 关于数据结构中二叉树的一个实例，代码比较简单，容易看懂。-About one example of a binary tree data structure, code is relatively simple, easy to understand.
CQuicksort
- 此实验是数据结构课上使用的快速排序的优化算法，代码比较完全-This experiment is the data structure class used in the fast sorting optimization algorithm, the code is more complete
recursion
- 几个c++递归算法，仅供参考，代码比较简单(Several c++ recursive algorithms, for reference only, relatively simple,good luck)
recursion_cycle
- 两个c++递归循环算法，代码比较简单，仅供参考(Two c++ recursive loop algorithms, the code is simple, for reference only)
recursion_overtime
- 几个c++递归超时算法，代码比较简单，仅供参考(Several c++ recursive timeout algorithms, the code is simple, for reference only)
sort
- 两个简单的c++排序算法，代码比较简单，仅供参考(Two simple c++ sorting algorithms, the code is relatively simple, for reference only)