Curve cubic spline interpolation, in both nodes with non

n个石头(每相邻两个的距离是1米,最边上石头和岸的距离也是1米),礼物放在第m个石头上,青蛙第i次跳2*i-1米.问能否得到礼物.(n>=49肯定能得到礼物,n

用于多个离散点拟合光滑曲线的，优化了追赶法，这个例子适用于闭合和不闭合两种情况。当时由于工程情况，写的急，代码不好看，但是很好用。为了方便传递参数，我做了一个链表，用时候根据自己情况可以修改，核心算法不动即可。-point for a number of discrete smooth curve fitting, and optimized to catch up with the law applicable to this case is not closed and the closure of two. At that time, because the situation, was the most aggressive, the code does not look good, but good use. To facilitate the transmission parameters, I have done a linked list, when used according to its own circumstances can change, the core algorithm can be fixed.

参考《数据结构（C语言）》（严蔚敏版）所提的迷宫算法的概念，通过栈结构实现对迷宫从出口到入口的路径搜索算法实现，代码在vs2010环境下进行测试，全部代码包括main.cpp,maze arithmetic.cpp,maze stack.cpp,maze stack.h四个文件，其中maze stack.cpp文件为栈结构的实现代码，maze arithmetic.cpp为迷宫路径搜索算法的实现代码，main.cpp为测试代码。经过测试，代码能够正常运行。

问题算法源代码：骑士遍历、万年历、N皇后问题回溯算法、动态计算网络最长最短路线、货郎担分枝限界图形演示、货郎担限界算法、矩阵乘法动态规划、网络最短路径Dijkstra算法-problems algorithm source code : Knight traversal, calendar, N Queens backtracking algorithms, Dynamic computing network longest shortest routes, traveling salesman Branch and Bound graphic demonstration, traveling salesman Bound algorithm, Matrix multiplication dynamic programming, network Dijkstra shortest path algorithm

埃尔米特等距插值-Hermite"s equidistant interpolation

该程序在TC环境下运行。 按键1-6可以画6中常用的不同极坐标曲线。 按按键 q 退出。 你可以添加你想知道或者尝试任何你想象的曲线。-The program runs under the environment in the TC. 1-6 keys can be painted in 6 different commonly used polar curves. Q according to exit button. You can add or you want to know any of you try to imagine the curves.

还可以，能够加快迭代的计算速度，大家用一下-can to accelerate the iterative calculation speed, we spent about

用最小二乘法求矩形区域上的N*M个数据点的拟合曲面。-Least square method for rectangular area on the N* M data points of the fitting surface.

数值分析牛顿插值经典源码-numerical analysis Newton"s classic source

希尔排序-Sort Hill