二叉树的中序遍历

计算方法《牛顿差值》-calculation method, "Newton margin"

Convert function from Hex to bi

目的是把左边的所有盘子移到右边的杆子上。一次只能移动一个盘子，你可以使用中间的杆子作为临时存放盘子的地方。小盘子必须放在大盘子之上。问题看似不难。的确，如果盘子只有两三个，是很容易解决的。但是随着盘子数目的增加，问题就变得非常难解了。 -purpose is to the left of all the dishes moved to the right side of the pole. Only a mobile one tray, you can use the middle of the pole plate as a temporary storage place. Small plates must be placed on the platter on top. It may seem it is not difficult. Indeed, if the plate is only 23, it"s very easy to solve. But with the increase in the number of dishes, the problem has become a very difficult.

用C编写的迷宫最短路径。另有一用VC编写的-C maze prepared by the shortest path. Another one prepared by the VC

龙格库塔法的c语言实现-Runge- Kutta method in C Language

一种用C语言实现的快速傅立叶变换和傅立叶反变换,经测试十分好用-A C-realize the fast Fourier transform and Fourier inverse transform, have been tested and is very easy to use

use c code function in matlab

最小二乘法线性拟合,数值计算方法中的一种经典算法-Least_squares algorithm linear fitting curves,A kind of classic algorithm of the number calculation

该软件能够对振动信号进行采集并同时进行频谱分析，对波形进行存储，处理的过程中可以对不需要的频率进行去除。-The software is capable of vibration signal acquisition and the same time spectrum analysis, the waveform storage, the process can not remove the frequency.

背包问题最优算法- Knapsack question most superior algorithm