c 语言实现avl树

应用背景简化了map的功能，应用于高效的查询；不维护迭代器等功能，提供数据从启动到停止生命周期内的快速查询，不提供删除数据，只提供清理数据；经过测试千万数据的查找比map快5倍关键技术根据红黑树的算法，实现了key、value存储map，完全按照平衡树的原理，实现了快速添加和查找功能

这是复数的加减法运算源代码.使用C++在VC环境中实现.-This is the plural of addition and subtraction operations source. The use of C in the VC environment to achieve.

最短小的dvd解码程序-shortest small DVD decoding procedures

此程序用于道路放样的曲线要素的计算简单而方便-This procedure for setting-out the curve of the road element of the calculation is simple and convenient

7. 求矢量夹角余弦 8. 求线段之间的夹角 9. 判断线段是否相交10.判断线段是否相交但不交在端点处 11.求线段所在直线的方程 12.求直线的斜率 13.求直线的倾斜角14.求点关于某直线的对称点15.判断两条直线是否相交及求直线交点16.判断线段是否相交，如果相交返回交点-7. For vector cosine angle 8. For the angle between the line 9. Line judge whether the intersection 10. Line judge whether the intersection but do not pay the endpoint Office 11. For the straight line segment where equation 12. For a linear slope 13. Seeking straight tilt angle 14. For a certain point on a linear symmetrical 15 points. to judge whether the intersection of two straight and for 16 straight intersection. Line judge whether the intersection, the intersection to intersection

资源描述问题描述：给定一个由n行数字组成的数字三角形，如下图所示。试用动态规划算法，计算出从三角 顶部至底部的一条路径，使得该路径经过的数字总和最大。 注意每个数字只能走向下一行左边或右边的数字，而不能跳跃的走。 7 3 8 8 1 0 2 7 4 4 4 5 2 6 5

一个xx的聚类分析算法-xx of a cluster analysis algorithm

poj 2408 解题代码，北大acm在线可以测试。-problem-solving poj 2408 code, North acm test online.

该程序用来处理微分方程系统的,用来化简一个微分系统的,特别是高维的系统,用来计算中心流行-The procedures used to deal with differential equations system for the simplification of a differential system, especially high-dimensional system, used to pop Center

C＃，DotNet FrameWork2.0,计算4张牌四则混合运算以后等于24的算法源码-C#, Delegate FrameWork2.0. Calculation four licensing mixed four to 24 after the operator of the algorithm source code