ACM竞赛的一些搜索剪枝算法的应用，供大家学习

利用Access做用户界面，用Access VBA开发计算24点的程序，然后通过遍历输出所有可能结果。 小学数学老师会利用算24来锻炼小学生的心算能力，作为家长，如果孩子如果有一道题算不出来向您求救时，您却拿不出一个解决方案来，岂不丢面子? 好了，现在有了这个工具，您可以在1秒钟内给出多个答案，孩子会更崇拜您哦！    :-)

1.用“先来先服务（FCFS）”算法和“最短作业优先（SJF）”算法模拟作业调度。 要求：按作业的到达顺序输入各作业需要的运行时间，按算法调度输出平均周转时间。 例如(FCFS)，输入：8（到达时间0）， 5（到达时间2），7（到达时间3），1（到达时间6）

高斯消去法求解线性方程组，以在TC2.0中编译通过-Gaussian elimination method for solving linear equations, in which the compiler through WITH TC 2.0

矩阵乘法是线性代数运算中最常见的运算,它在科学研究以及工程开发中都具有举足轻重的作用,提高其运算的效率是很多大型的学术研究中的内容,这边论文是分析主要的两个矩阵乘法算法.-Linear algebra matrix multiplication is the most common operation, it is in scientific research and engineering development have a decisive role in raising the efficiency of its operations for many large academic research of the contents of papers here is to analyze the main two a matrix multiplication algorithm.

Bellman Ford algorithm for finding the shortest path between nodes is an algorithm used.  primarily in the gray box identifies nodes are between our EDGE. Then we set the starting node (for one example)  resulting path will be drawn on lef

求素数，并且保存于文本文件，并且下次执行还可以接着上次的结果继续找下去 所以总有一天你会找到最大的素数……每天就像挂Q一样挂一下这个程序就行了-Seek primes, and stored in a text file, and the next performance can also be followed by the last results continue to look down so that one day you will find the largest prime number ... ... the same day, just hanging Q hang about this program on the list ... ...

Example to calculate, with basic operations, polinomial til 10 degrees, just the first step for solution of polinomial problems, can be implemented according to your wish-Example to calculate, with basic operations, polinomial til 10 degrees, just the first step for solution of polinomial problems, can be implemented according to your wish

实对称矩阵特征值与特征向量的雅克比法，ap为是对称矩阵，vp返回特征向量-Real Symmetric Matrix Eigenvalues and Eigenvectors of the Jacobian method, ap is a symmetric matrix, vp return eigenvector

所有相关的数据挖掘算法和理论，都有详细的说明，有兴趣的可以下一步做

S先生与P先生谜题 设有两个自然数X、Y，2