利用黄金分割法求解线性方程组逼近问题。转载

用C语言实现的二维几何运算源码，包含了常见的二维几何运算，包括： ㈠ 点的基本运算  1. 平面上两点之间距离 1  2. 判断两点是否重合 1  3. 矢量叉乘 1  4. 矢量点乘 2  5. 判断点是否在线段上 2  6. 求一点饶某点旋转后的坐标 2  7. 求矢量夹角 2  ㈡ 线段及直线的基本运算  1. 点与线段的关系 3  2. 求点到线段所在直线垂线的垂足 4  3. 点到线段的最近点 4  4. 点到线段所在直线的距离 4 

fortran code of dipole antenna

32K点的fftVHDL实现,可直接在可编程逻辑器件上运行实现-32K fftVHDL points, which could be directly in the programmable logic device to achieve run

单舵机实验，c语言,STC51单片机控制单个数字舵机，讲述舵机原理， 软件仿真PWM控制数字舵机。

北大ACM试题poj 第3058题源码，很好的代码，希望对搞ACM的同学有帮助 -Peking University ACM Chapter 3058 question Question poj source code, good code, and want to help students engage in ACM

很好的算法，可广泛用于各行业（如工控）计算组态-It s a very good arithmetic that can be used at many industries.such as industry control,for caculation configuration.

有关ACM的一些算法研究，主要是线段树方面-Line Tree

Modern C++ Design 一书中实现的程序库，全面体现Policy Based Programming 的灵活，提供了诸多设计模式何smart pointer的灵活实现，强烈推荐！--The program library which has been realized in the book >, it embodies the flexibility of Policy Based Programming, and provides the realisation of various design models of the smart pointer, it`s recommended strongly!

vc7 MFC regular d

三色球问题 若有一个口袋放有12个球，其中有3个红的，3个白的和6个黑的，从中任取8个球， 问共 这也是一个可用穷举法求解的问题。 设任取的红球个数为i, 白球个数为 j，则黑球个数为8-i-j，用count统计不同的搭配数目- Three chromospheres questions if have a pocket to put have 12 balls, including 3 red, 3 white and 6 black, no matter what takes 8 balls, asked altogether this also is may use the question which the exhaustion method solves. Supposes no matter what takes the red ball integer is i, the white ball integer is j, then the black ball integer is 8-i-j, counts differently with count matches the number