搜索资源列表
Haskell教程
- Haskell教程(by rufi) 传统的Basic,Pascal,C++,C#,Java,Python等都是命令(imperative)编程语言, 程序语句有一定的执行次序. 函数(functional)编程语言则给出执行的内容, 关注于更高层次的\"做什么\"而不是\"怎么做\", 这就是二者最明显的一个区别。函数编程语言的语法功能非常强，使编程的效率大幅提高。 Haskell是世界上公认的语法最优美最简洁的一种语言。的确，Haskell语言是写给人看的，而不是写给机器看的。另
OL.rar
- 可以实现数值分析中的欧拉法、后退欧拉法和改进欧拉法的计算，程序中涉及到拉界面，以及许多控件的使用。,Numerical analysis can be achieved in the Euler, backward Euler and improved Euler s method of calculation, the procedure involved in drawing interface, as well as the use of many controls.
Bankers
- Banker s Algorithm Implement by Java
coherence
- Java实现的快速自相关算法:提供交互界面,可读入外部数据文件-Java's rapid auto-correlation algorithm : to provide interfaces to external data into readable document
MonteCarlo
- 内容包含两部分：一是判断是否为素数的MonteCarlo算法；另外给出了一部分素数。MonteCarlo是一种概率算法，一般的算法书上都会提到，这是以前课程设计的一部分，用Java实现，希望对大家有用。-A MonteCarlo algorithm for finding prime numbers, which was part of my course design. Maybe it s helpul for you.
Planer_convex_hull
- A Convex Hull is the smallest convex polygon that contains every point of the set S. A polygon P is convex if and only if, for any two points A and B inside the polygon, the line segment AB is inside P. One way to visualize a convex hull is to put
SimpsonsRule.java
- Simpsons Integration: In numerical analysis, Simpson s rule is a method for numerical integration, the numerical approximation of definite integrals. Specifically:
AG_caixeiro_viajante
- Code in java for the Traveling salesman problem. This code is very simple because has only three pages. It s works same.
digikstraalg
- This code is used to find the shortest path between two nodes using digikstra s algorithm
bank
- Java版本银行家算法，运行了死锁避免与死锁检测模拟程序，可以在Eclipse上直接运行-Java version of the banker' s algorithm, run the deadlock avoid deadlock detection simulation program that can run directly on the Eclipse
ConvexHull
- In this project, three convex hull algorithms are implemented in java. Three algorithms are Brute Force, Graham’s Scan and Jarvis’ March.
JavaApplication2
- Java Shannon Fano Algorithm , encryption and decryption. CitireBit.java read bit by bit from text/bmp file Compara.java compares 2 bits In.txt it s the in file for the interface and algorithm Interfata.java it s the interface file Nod.java
TestAlgorithm
- 求花朵数的JAVA代码实现 一个N位的十进制正整数，如果它的每个位上的数字的N次方的和等于这个数本身，则称其为花朵数。 例如： 当N=3时，153就满足条件，因为 1^3 + 5^3 + 3^3 = 153，这样的数字也被称为水仙花数（其中，“^”表示乘方，5^3表示5的3次方，也就是立方）。 当N=4时，1634满足条件，因为 1^4 + 6^4 + 3^4 + 4^4 = 1634。 当N=5时，92727满足条件。 实际上，对N的每个取值，可能有多个数字满足条件。
horse
- 用JAVA写的一个比较好的骑士巡游问题的解决代码，时间复杂度极低-Written with JAVA A good knight' s tour solution to the problem code, the time complexity is very low
yanghuisanjiao
- 杨辉三角的java版本,最大行数由用户给定,按照格式排列下来,PS:控制台显示-Pascal' s Triangle java version, the maximum number of lines given by the user, are arranged according to the format down, PS: Console Display
Topsis
- TOPSIS - It s a java source code for multi criteria decision making using topsis
newtonsolve
- 采用JAVA实现线性方程的牛顿法计算，并提供了源码-Calculated using JAVA implementation of Newton' s law of linear equations
KruskalAlgorithm
- kruskal in java simple, easy, i hope that s useful thanks