组合问题，从M个不同字符中任取N个字符的所有组合

一元稀疏多项式计算器的基本功能是： (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.

一款很使用的数据库代码-one is the use of the database code

很好的教程实例，教务管理系统，Access数据库实现~-Very good tutorial examples of educational management system, Access database, to achieve ~

设备管理系统，具有参考价值-equipment management system, with reference value

算法函数实例，算法1，存放了书中所有的算法函数程序以及例子中的主函数程序-arithmetic functions example, an algorithm, the book store all the arithmetic functions procedures and examples of procedures for the main function

实现各种内部排序。包括冒泡排序，直接插入排序，Shell排序，快速排序，堆排序，并比较排序的比较次数和移动次数。主要是C语言。-achieve internal order. Including bubble sort, direct insertion sort, Shell sort, quick sort, heap sort, and compare the ranking of number and mobile number. C is the main language.

一个最短路的c实现，比较完美-one of the most short-circuit c achieve more perfect

二 叉 树 的 建 立 与 3 种 遍 利(前序,中序,后序三种),仅供参考之用-binary tree with the establishment of three times Lee (former sequence, sequence after sequence of three), for reference only

Matlab 实现的 "WinPR" 文件的基础：获取更多地从图像分割评价。页 362-366 D.NAACL 打 2012 年 Scaiano M.，Inkpen原始脚本 http://scaiano.com/martin/SegEval.htmlMatlab 的适应： Juan G.法国

一个经典的数据结构的实现-a classic of the data structure to achieve