Algorithm Design Manual 欢迎你下载ginger547的算法系列资料

aprioi算法用于数据挖掘的关联处理，对于数据挖掘只是可以更好的了解-aprioi algorithm for data mining of association deal with, for data mining can only have a better understanding of

poj2528 代码。关于北大acm的题解，关于线段树的算法。这是一道经典的线段树的题目，另外加上离散化的方法。由于题目中最大10000000，直接线段树无疑会大大超出内存限制，所以要对其离散化，基本做法是：先对所以端点坐标进行排序，用相应序号代替端点坐标构造线段树进行计算。

分数阶统一混沌系统的离散算法-This the program for fractional order Unified system, a simple but fast method in time domain.-Fractional order unified chaotic system discrete algorithm-This the program for fractional order Unified system, a simple but fastmethod in time domain.

读6050的加速计 陀螺仪 数据，与单片机进行IIC通信，进行姿态解算后，输出角度信息。

哈夫曼编码和解码系统,并可对文件进行编码-Huffman coding and decoding system, the documents can be encoded

实现了两个大数的加法，速度很快．最大可以是５００位数的相加-realized the majority of the two Adder, very fast. It is the largest of the median combined 500

根据材料的不均匀性和组成材料都是有所不同结构时，进行一次元和二次元以及三次元的模拟计算需要在参数R值上设定在0.5以下0.03以上才能保证结果稳定性

计算弹性模量的小程序，学力学的同学用得上-calculate the elastic modulus of small programs, students learn mechanics useful

鲍威尔法求极值，非常好用和精确度比较高。希望大家喜欢-Powell, seeking extreme value method is very easy to use and relatively high accuracy. Hope everyone likes

独立于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.