资源列表
zhebanchazhao
- 这半查找法 是一种快速查找算法 查找效率比较高 容易实现 理想的查找算法-This search method is a fast and find more efficient algorithms to find easy to implement the ideal search algorithm
hanfuman
- 哈弗曼编码 一种编码方式 和费诺编码 一样 是可以实现的一种编码算法-The Ha Fuman encoding a encoding and Fenno coding as an encoding algorithm can be achieved
Fenno-coding
- 费诺编码 一种编码方法 和哈弗曼编码 其他编码都能实现的编码算法-Fenno coding
dij
- dijkstra单源最短路径源代码模板，迪杰斯特拉算法-the short path
cccc
- 顺序结构程序设计，c语言， 数据结构算法 ，-Order of structured programming, c language, data structures, algorithms
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.
BtreeOrder
- 二叉树的遍历，实现二叉树的前序、中序、后序遍历，包含递归和非递归算法-Binary tree traverse, realize the binary tree before, in order of sequence, after traverse sequence, including recursive and the recursion algorithm
Sort_Cmp
- 比较快速排序和冒泡排序的时间消耗，随机产生输入范围内的数交分另排序，比较两者用的时间-More quick sort and bubble sort of time consumption, randomly generated within the scope of the input into the other sort several points, compared with both of the time
BTreeChange
- 实现二叉树左右子树交换，先建立二叉树，打印输出，再将左右子树交换输出-Realize the binary tree son exchange about the tree
QUICKSORT
- 描述快速排序，一个简短的算法程序，将一维数组中的元素由小到大排序-QUICK Sort
priority_queue
- 优先队列的使用使用优先队列，首先要包函STL头文件"queue"，以一个例子来解释吧(呃，写完才发现，这个代码包函了几乎所有我们要用到的用法。-The use of priority queue using a priority queue, we must first package the letter STL header file "queue", an example to explain it (uh, finished only to find the code package l
LCS
- 最长公共子序列的算法实现。基于动态规划的丝线实现的算法-The longest common subsequence algorithm. Realization of the algorithm based on dynamic programming thread