这是关于古代9连环问题的求解过程，包括安装跟坼卸

一元稀疏多项式计算器的基本功能是： (1)输入并建立多项式； (2)输出多项式，输出形式为整数序列：n,c1,e1,c2,e2,….,cn,en, 其中n是多项式的项数，ci和ei分别是第I项的系数和指数，序列按照指数降序排列； （3）多项式a和b相加，建立多项式a+b （4）多项式a和b相减，建立多项式a-b.-Sparse Polynomial calculator a dollar a basic function is to: (1) input and the establishment of polynomials (2) the output polynomial, the output sequence of the form of an integer: n, c1, e1, c2, e2, ...., Cn , en, in which n is the number of polynomial, ci and ei, respectively, is the first I of the coefficient and index, sequence in accordance with the index in descending order (3) polynomials a and b are added together to establish polynomial A2B ! b (4) polynomials a and b-phase reduction, the establishment of polynomial ab.

K阶菲波那契算法，运用环形队列实现，空间是K+1-K bands Fibonacci algorithm using circular Queuing, and the space is a K

改进后的算法大大减少了对于那些运动矢量为零的块的搜索冗余，同时对于运动比较剧烈的块直接进入大范围搜索。这样即提高了搜索效率，又不会使搜索结果陷入局部最优。-improved algorithm greatly reduced for those zero motion vector search block redundancy, Meanwhile, more intense campaign of direct access to block large-scale search. That would improve the efficiency of search, the search results will not find the global optimum.

关于数据结构中矩阵转置的算法。-data on the structure of the matrix transpose algorithm.

基于数据结构的相关知识点，构造的基数排序-Knowledge-based data structure point of radix sort

这是一个有关决策树分类器中C4.5算法的原程序-This is a decision tree classifiers on which the original algorithm C4.5 procedures

N皇后问题的解决方案,利用回归的方法.方法易懂-N Queens solution to the problem, using regression. Methods to understand

最小生成树,基本满足最小生成树的所有的要求。-Minimum spanning tree, minimum spanning tree basically meet all the requirements.

停车场的程序，是用多线程写的，有详细的注释-parking procedures is the use of multi-threaded writing, a detailed Notes

仓储药房管理系统-warehousing pharmacy management system