串行口升级子程序支持1

人工智能算法K-meadians算法java实现-Artificial intelligence algorithm K-meadians realize algorithm java

JAVA数据结构之HASH编码的小应用程序-Java data structures hash coding of small applications

线形方程组类:包括各种线性方程组的各种求解方法，非常方便调用-Linear equations categories: including a variety of linear equations to solve a variety of methods, very convenient to call

独立于AVL库的存储媒体 虽现在有不少可用的AVL树库，但几乎都是工作在RAM中，当数据量小的时候，这种方式可行，但当树结构变大时时，读取和存储的时间就会大大变长，任务效率大大降低。能不能直接用磁盘进行树的操作呢？若可以，就不必进行频繁的磁盘内存交换了，本程序就实现了这个功能。实际上，这个程序无论是磁盘还是内存，都很好用。-independent of the AVL storage media is now available in a number of the AVL tree, But almost all work in the RAM, when a small amount of data, this approach feasible, but big tree structure constant, read and storage time will be much longer and the task efficiency has been greatly reduced. Can directly use the disk tree operation? If so, there is no need for frequent exchange of disk memory, the process to achieve this function. In fact, this procedure is disk or memory, are very handy.

QR方法求实系数多项式方程的全部根-QR method realistic polynomial equation coefficients of all-

16： 00傅里叶算法，采用标准C语言，优化计算速度，比传统算法快得多

对任意给定的n，用字典法和邻位互换法生成并打印全部排列。-right to the arbitrary n, using the dictionary to law and Exchange Act o-generated and print all ranked.

一多项式求值,求导,减法,乘法,加法. 输出形式为类数学表达式, 指数升序排列.-a polynomial function, derivation, subtraction, multiplication and addition. Output form of mathematical expression category, the index in ascending order.

格路问题：经典的算法分析与设计题目，用动态规划的方法解决从一个网格起点到终点的最短路径问题-Lattice path problem: the classical algorithm analysis and design topics, with the dynamic programming solution to start from a grid to the end of the shortest path problem

计算机图形计算：点乘 英文网页　没代码，更适合于理解其原理和方法和运用-computer graphic terms : point by the English website no code, is more suited to understand the principles and methods of use and