赫夫曼编码的具体方法：先按出现的概率大小排队，把两个最小的概率相加，作为新的概率 和剩余的概率重新排队，再把最小的两个概率相加，再重新排队，直到最后变成1。每次相 加时都将“0”和“1”赋与相加的两个概率，读出时由该符号开始一直走到最后的“1”， 将路线上所遇到的“0”和“1”按最低位到最高位的顺序排好，就是该符号的赫夫曼编码。
Huffman Coding (2016-05-22, Visual C++, 2KB, 下载1次)
四则混合运算表达式求值:
当用户输入一个合法的算术表达式后，能够返回正确的结果。
能够计算的运算符包括：加、减、乘、除、括号；
能够计算的操作数要求在实数范围内；
The four mixed computing expression evaluation:
When the user enters a valid arithmetic expression, they can return the correct results.
Operators can be calculated include: add, subtract, multiply, divide, brackets
Can count the operation requirement in the number range (2014-08-01, Visual C++, 428KB, 下载7次)
算法作业,迪杰斯特拉算法vs2008+opencv实现,任意构造有向图并计算图上任意两点最短路径及其长度
Arithmetic operations, Dijkstra algorithm using vs2008 and opencv , arbitrary construct a directed graph and calculate the shortest path between any two points on the map and its length (2014-06-16, Visual C++, 15412KB, 下载12次)
这是一个对算术表达式进行求值的控制台程序，程序主要用了数据结构中的栈的方法思想。先把表达式转化为后缀表达式，然后两对后缀表达式求值。程序可以实现对加、减、乘、除、乘方进行运算，还支持括号
This is an arithmetic expression is evaluated console program, the program mainly used the data structure stack method thought. First expression into postfix expression, and then two pairs postfix expression is evaluated. Programs can be achieved on addition, subtraction, multiplication, division, exponentiation for computing, but also support brackets (2013-05-27, Visual C++, 17KB, 下载1次)
1． 利用克鲁斯卡尔算法求网的最小生成树。
2． 利用普里姆算法求网的最小生成树。
3． 要求输出各条边及它们的权值。
1. Using Kruskal algorithm for the minimum spanning tree network. 2. Use of the the prim algorithm for the minimum spanning tree. 3. Output edge and their weights. (2013-05-11, Visual C++, 621KB, 下载2次)
数组元素访问的四种方法：
方法1通过数组名和下标访问数组元素
方法2通过数组名作为指针运算来访问数组元素
方法3通过指针变量加数组名访问数组元素
方法4通过指针变量加下标访问数组元素
Array element access to four methods: Method 1 by the array name and subscript to access the array elements through the array name as the pointer arithmetic to access array element method pointer variable and array access array elements method pointer variable and the subscript access array element (2012-06-27, Visual C++, 6KB, 下载3次)
POJ 1141题目源码+源码 题意： 给你一段 括号序列 让你输出 一个最小的让括号合法的序列 黑书上 有将 思路 ： dp[a][b] 代表 a b 之间 最小的需要填加序列数目 a==b时 dp[a][b]=1 a>b时 dp[a][b]=0 s[a] 与s[b]配对时 dp[a][b]=dp[a+1][b-1] 否则 dp[a][b]=min(dp[a][k],dp[k+1][b]) a<=k<b 记录路径采用 一般DP记录路径的方式 (2012-05-02, Visual C++, 1KB, 下载19次)
http://www.pudn.com/Download/item/id/1852518.html
有一个已经有序的数据序列，要求在这个已经排好的数据序列中插入一个数，但要求插入后此数据序列仍然有序，这个时候就要用到一种新的排序方法——插入排序法,插入排序的基本操作就是将一个数据插入到已经排好序的有序数据中,从而得到一个新的、个数加一的有序数据，算法适用于少量数据的排序，时间复杂度为O(n^2)。是稳定的排序方法。
Insertion sort in C/C++ (2012-04-20, Visual C++, 1KB, 下载3次)
利用hash函数将关键字的key值算出，先检验hash表中key位置是否有关键字。如果没有，则将关键字赋给其关键字域。如果有，则先检验其关键字域的关键字是否与捕捉到的关键字相同。如果相同，只需将关键字的出现次数加1就行了。如果不相同，就依次往后面检验，直到出现相同的关键字，只需将hash表中的冲突域加上循环的次数，出现域加1即可。如果遍寻hash表后都没有找到与之相同的，则要插入一个新的节点
The use of hash function the key key value calculated, the first test table in hash key position if there is a keyword. If not, then the key is assigned to the keyword domain. If there is, then examine its keyword domain keywords and capture the keywords in the same. If the same, only the keyword occurrences plus 1 on the line. If not the same, in turn towards the back of inspection, until the emergence of the same keyword, only the hash table in a collision domain plus the number of cycles, add 1 to appear domain. If the searched hash form did not find the same, to insert a new node (2012-03-02, Visual C++, 2KB, 下载4次)
数组元素为指针的数组称为指针数组
例： int *pa[3]
数组有三个元素， 每个元素是一个int型指针
pa是指向该一维一级指针数组的指针,是二级指针
Array element as pointer to array of pointers to arrays example: int* pa [3] array has three elements, each element is an int pointer pa is a pointer pointing to the one-dimensional array of pointers, the two pointers (2011-11-04, Visual C++, 13KB, 下载2次)
C++算法大全，里面包含了单元加，底层编程，汉诺塔，逆阵，求进制，数据结构，数学问题，数组，文件程序，问题算法，小写数字转为大写数字，校验算法，硬币情况，字符，还有各种链表
C++ algorithm for Guinness, which contains the unit increases, the underlying programming, Tower of Hanoi, inverse matrix, find the binary, data structures, mathematical problems, array, documentation procedures, the problem algorithms, lower case to upper case figure numbers, calibration algorithm, coins situation, character, and various lists (2011-05-02, Visual C++, 621KB, 下载17次)
这个代码为我写的混合蛙跳程序，大概有4个高维测试函数。有力的说明蛙跳程序是一个有效的程序，希望提供给研究蛙跳的朋友。谢谢
I wrote this code mixed leapfrog procedure, there are about four high-dimensional test function. Strong that leapfrog procedure is an effective procedure available to researchers want to leapfrog friends. Thank you (2011-04-26, Visual C++, 985KB, 下载74次)
用克鲁斯卡尔算法实现的最小生成树代码,要输入边的信息，每条边的信息包括两个顶点号（从1开始）及权值。在这个程序里顶点信息不太重要，只是用一个字符保存的，如需要可自己更改。
create a minimum tree use the Kruskal arithmetic. (2011-03-31, Visual C++, 245KB, 下载3次)
利用单链表实现一元多项式的加、减、乘法，含有开辟多项式所需空间、判断用户输入正确与否、构造节点存放多项式系数和指数、构造多项式、多项式整理（按指数从小到大存放）、撤销多项式所在节点、合并同类项、多项式加法、多项式减法、多项式乘法、多项式长度计算等。
Using a single linked list to achieve a polynomial addition, subtraction, multiplication (2011-03-29, Visual C++, 84KB, 下载4次)
建立一个双向循环链表,并在里面增加一个freq,初使为0,每当lcate(l,x)访问X一次相的freq加1,同时链表顺序也按freq的大小非递增排列
A two-way circular linked list, and in which an additional freq, initialization is 0, when lcate (l, x) access to a phase freq X plus 1, but also by freq list the size of the order of non-increasing order (2011-03-05, Visual C++, 1KB, 下载3次)
是公园路径搜索的c++实现方法，功能比较简单，是课程设计的。用到了迪杰斯特拉算法和贪心算法求最短路径
Is a park path search c++ implementation method is relatively simple functions, curriculum design. Use the Dijkstra algorithm and the greedy algorithm for the shortest path (2010-06-08, Visual C++, 5KB, 下载2次)
1． 利用克鲁斯卡尔算法求网的最小生成树。
2． 利用普里姆算法求网的最小生成树。
3． 要求输出各条边及它们的权值。
1. Using Kruskal' s algorithm for minimum spanning tree network. 2. Prim algorithm for the use of the minimum spanning tree network. 3. Requirements of the output of each side, and their weights. (2009-06-18, Visual C++, 20KB, 下载13次)
最短路径----迪杰斯特拉算法这是用数据酷编写的超级还曾需飞行行分区地方人个还有就适合打击的假死优化哦
---- Dijkstra shortest path algorithm which is used to prepare data super cool flight line had to be a district where there are suitable for people against the suspended animation optimization Oh (2009-06-03, Visual C++, 860KB, 下载1次)
第六章 模板与数据结构习题
6.2.1 需要编写一个对多维数组通用的算法（即各维的大小未定），怎样才能把实参多维数组的信息全部传递到函数中去？
Chapter VI with the data structure template 6.2.1 Exercises need to write a generic algorithm for multi-dimensional array (that is, the size of the peacekeeping undetermined), how can the real multi-dimensional array parameter information passed to the function all go? (2008-09-13, Visual C++, 17KB, 下载8次)
是一个精典的递归加动态规化的题
题目：有M个苹果要求放入N个篮子中，求出放法的总数（N个篮子中放的苹果数不限定，有的也可以不放）
Is a classical recursive plus dynamic regulation of the title subject: M has an apple basket request Add N months, the release method to derive the total number (N a basket of apples put a few non-limiting, some can not release) (2007-09-06, Visual C++, 1KB, 下载43次)