Newton down France

求函数极小值，适用于不带约束的、函数可以为非线性的无约束规划问题的求解-Demand function is minimum applicable to non-binding, the function can be non-binding for the non-linear programming problem solving

一个数学算法的大集合-a mathematical algorithm large pool

大数类，重载了各类操作符，可以直接使用-fate categories, a variety of heavy-duty operator can be used directly

#include   #include   #include   #include   #include   char gcText[] = " WWWWWWW";  struct tetris {      int _pool[16][32], (*pool)[32], tmap[8][4][16];      int x, y, s, st, t;  }gt;  void trsInit() {      int sp[8][4]

离散型hopfield源码-discrete source

约瑟夫问题。有N个人围成一圈，按顺序编号。从第一个人开始报数，疏导m时候该人退出，并且下一个从1开始报数。求出圈人的顺序。-Joseph problems. There are N individuals and form a circle, according to sequentially numbered. Starting from the first person reported that the number of times to ease the person out of m, and the next one starting from a newspaper a few. Find the circle of people order.

牛顿下山法，比较好用！-Newton downhill, better quality!

Torrent下载自ExtraTorrent.com

算法需要的是针对同一组数据，采用拉格朗日法，牛顿插值法，分段线性插值法来进行比较不同算法下同一数据的精度情况和误差情况