test1.txt中为要读入的英文文章，code.txt为生成的huffman编码，decoded.txt中为根据code.txt中内容解码后的结果。...

poj3233的题目及解题代码 poj3233的题目及解题代码-poj3233 the subject and the subject of problem-solving and problem-solving poj3233 code code code poj3233 the subject and problem-solving

施伯乐@黄皮书《数据结构教程》part2-Shi Bole @ beige book Data Structure Course part2

应用背景把你的MS Access文件mysql数据库有问题？这是解决问题的方法。简单和直接…关键技术虽然很多人认为VB6被废弃，其性能仍然可以感受到了第一手的GUI应用程序设计。成千上万的应用程序运行在VB6。

实验中我们使用了四种方法进行串匹配，通过对相同的文本和相同的模式串进行四种不同算法的串匹配操作，比较四种算法的优劣。-Experiment we used four methods for string matching, through the same text and the same pattern for four different algorithms string matching operation to compare the merits of the four algorithms.

主要为VC数据库编程使用，详细介绍了ODBC和oledb

实现m阶B_树 （2）将线性表中的键值插入到B_树中（即建立索引）； （3）当删除和插入数据到线性表时，同时维护其索引B_树。 （4）可根据所给键值范围，输出该范围的所有键值-achieve m bands Containing tree (2) linear scale for the keys inserted into Containing tree (index); (3) When the deletion and insertion of data to the linear scale, while preserving its index Containing tree. (4) According to the pair, the scope of the output of all keys

数据结构 详细描述了如何创建二叉树的方法以及操作-Data structure described in detail how to create a binary tree method and the operation of

这是一个字符串快速匹配的算法KMP算法，大家可以通过此算法的学习来提高自己的算法水平-This is a fast string matching algorithm KMP algorithm, we can learn through this algorithm to improve the level of their algorithm

八 方块移动游戏要求从一个含8个数字（用1-8表示）的方块以及一个空格方块（用0表示）的3x3矩阵的起始状态开始，不断移动该空格方块以使其和相邻的方 块互换，直至达到所定义的目标状态。空格方块在中间位置时有上、下、左、右4个方向可移动，在四个角落上有2个方向可移动，在其他位置上有3个方向可移 动。例如，假设一个3x3矩阵的初始状态为： 8 0 3 2 1 4 7 6 5 目标状态为： 1 2 3 8 0 4 7 6 5-Eight-box requirements of mobile games from one containing eight numbers (1-8 with express) the box, as well as a space box (with 0) of the 3x3 matrix of the initial start, and constantly move the box to make space its adjacent box and swap until they reach their defined target state. Spaces in the middle position box has the upper and lower, left and right direction of four removable, in the four corners there are two directions can be mobile, in other locations has three movable direction. For example, suppose a 3x3 matrix of the initial state as follows: 803,214,765 target state as follows: 123,804,765

平分算法来查找任何方程的多个根元素。它以输入的任何命令的多项式，给你的多项式的全部根。