8数码问题

清华大学2002年出版的《科学与工程数值计算算法Java》配套源码，包括复数计算、矩阵运算、插值计算、线性非线性方程组求解、数值积分、数值拟和与逼近等算法和类，对于科学和工程数值计算很有参考价值！-Qinghua University, in 2002 published "Science and engineering numerical algorithm Java" complementary source, includes the plural, matrix computation, interpolation, linear solve nonlinear equations, numerical integration, and the proposed numerical approximation algorithms and other categories, science and engineering numerical computation of great reference value!

逐次超松驰迭代法(Successive Over Relaxation Me thod,简称SOR方法)是高斯―塞德尔方法的一种加速方法，是解大型稀疏矩阵方程组的有效方法之一，它具有计算公式简单，程序设计容易,占用计算机内存较少等优点,但需要较好的加速因子(即最佳松驰因子).下面我们首先说说松驰一词的含意,再利用它来解释雅可比迭代法与高斯―塞德尔迭代法,最后给出逐次超松驰迭代法的推算公式和收敛性条件.-Successive over relaxation iteration method (Successive Over Relaxation Me thod, called SOR method) is the Gauss- Seidel method for an accelerated method is solution of large sparse matrix equations, one effective method, it has a simple formula, programming easy, take up less computer memory, etc., but the need for better acceleration factor (that is, the best relaxation factor). Let us first talk about the meaning of the term relaxation, and then use it to explain the Jacobi s iterative method and the Gauss- Seidel iterative method, and finally gives successive over relaxation iterative method of projection formula and the convergence condition.

驱蚊器我哈是老大时间考虑的哈萨克大家啊还是卡刷空间的那上面那层啊考试监考大师大师的快乐啊斯达康那是大陆是看得见老师都没拿

以C-Fourier变换为基础的编程，帮助有兴趣的爱好者。

A*算法实现迷宫寻路功能，用启发式函数的编写以及各类启发式函数效果的比较。

找数字，求最大数与最小数，循环右移k位，删除一个数，知道一个数删数，冒泡排序，插入排序的基本代码

在数值计算中，一般的牛顿迭代法得到的数值具有截断误差，因此，用VB编写的可是实现任意精度的圆周率的计算程序-in numerical calculation, the general Newton iterative numerical method with the truncation error, therefore, prepared by the VB But to achieve any degree of accuracy the circumference of the rate calculation procedures

没有界面，用C写的小程序 问题如下：一家软件公司招聘了数十位程序员，分成若干部门。 进行一次考试，对各个部门的所有程序员进行考核。考试结束后评出了每个人的分数。现在需要知道，在每个部门内，成绩最好的程序员和成绩最差的程序员分别是谁。输入有N+1行，每一个有若干正整数。第一行只有一个正整数，代表公司的部门数目。剩余的N行，每一行代表了该部门所有程序员的得分。其中每行第一个数字k代表了该部门的程序员个数，该行剩下的有k对数据，每对数据包括一个程序员的姓名（一个字符串）和其得分（一个正整数）。【输出形式】输出有N行，每行有两个串。第一个串该部门得分最高的程序员的姓名，第二个数字是得分最低的程序员的姓名。-no interface, written in C minor procedural issues are as follows : a software company recruited dozens of programmers, divided into several departments. An examination of the various departments for testing all programmers. Examinations in 1886 after the end of each grade. Now need to know, in every sector, but the best programmers and the worst programmers who were. N input is a line, each one a number of positive integers. There is only a first positive integer representing the number of departments. The remaining N firms, each firm on behalf of all the sector"s programmers to the basket. Each Bank figures k a representative of the number of programmers, the bank left the k right d

程序是我们上课时中用到的，工程科学计算与C程序集 （上，下） 相信是很有用的！-is our class names, scientific computing and engineering procedures Set C (upper and lower) believe that it is very useful!

Clustering through Decision Tree Construction - CLTree - A subspace clustering algorithm.-Clustering through Decision Tree Construction- CLTree- A subspace clustering algorithm.