资源列表
the_Kth_Of_Sequence
- the_Kth_Of_Sequence
HuffmanCoding
- Huffman于1952年提出一种编码方法，该方法完全依据字符出现概率来构造异字头的平均长 度最短的码字，有时称之为最佳编码，一般就叫作Huffman编码。-Huffman coding in 1952 proposed a method based on characters appear completely different prefix probability to construct the average length of the shortest code word, som
Double-list
- 实现双链表的代码-DOUBLE list
queuejas
- 一个队列的创立及应用的源代码，不是很高端-A queue creation and application source code is not very high
1014
- 浙大 编程能力测试 的甲级题目 第 1014. Waiting in Line (30) 又是一道服务队列问题-uppose a bank has N windows open for service. There is a yellow line in front of the windows which devides the waiting area into two parts. The rules for the customers to wait in line are:
kuaipai
- 设要排序的数组是A[0]……A[N-1]，首先任意选取一个数据（通常选用第一个数据）作为关键数据，然后将所有比它小的数都放到它前面，所有比它大的数都放到它后面，这个过程称为一趟快速排序。-The array is designed to sort A [0] ... ... A [N-1], first select an arbitrary data (usually the first choice of data) as the key data, and then all the num
123
- 电子老鼠创迷宫问题，主要用递归的方法求解得到最终走出迷宫的最小步数-E rat maze created problems, mainly with the recursive method for solving the minimum to get the final out of the maze the number of steps
fspx
- 使用C++描述的快速排序算法。使用C++描述的快速排序算法。-use c++ to do the fast sort algorithm
huiwen
- 该程序利用栈以及队列的基本知识，如：入栈，出栈等判断输入的字符串是否为回文。-The program utilizes the basic knowledge of the stack and queue, such as: the stack, the stack judgments input string is palindrome.
kuohao
- 括号匹配算法 数据结构 用c＋＋或c都实现的-brackets matching algorithm data structure with c + + or c realize the
poly.zip
- 一元多项式的加、减、乘、除法，用链表存储多项式的每一个结点,Polynomial plus one dollar, subtraction, multiplication, division, polynomial using linked list storage of each node
class4-ctree
- 由一线性数组生成一个完全二叉树，使用类描述，有详细注释，完整的输入输出-By a linear array generates a complete binary tree, use the class descr iptions, detailed notes, a complete input and output