Java写的“读者写者问题”示例

实现求解平面最近点对的复杂度为nlgn的算法。程序要求能够自动生成至少100万个点，并利用该算法求解。此外，要求支持图形界面的算法输入与输出。在此基础上，添加n^2级算法的实现，并比较相同规模下，两种算法的时间消耗。-Solving the nearest point on the plane to achieve the complexity of the algorithm for nlgn. Program requires the ability to automatically generate at least 1 million points, and the use of the algorithm. In addition, the algorithms required to support graphical user interface input and output. On this basis, add the n ^ 2 Ji Implementation of the algorithm and compare the same scale, the two kinds of algorithm" s time consuming.

这是一个利用JavaScript语言来设置一个用户登录的程序-JavaScript

转载 Java 2源码解读：java.util.ArrayList -reproduced Java 2 source explained : java.util.ArrayList

This program is using Genetic Algorithm to solve the Travlling Salesman Problem. It gives the best path route within a specified time. usage: java Evolver Author: Liu Yang -This program is using Genetic Algorithm to solve the Travlling Salesman Problem. It gives the best path route within a specified time. Usage: java Evolver Author: Liu Yang

eight puzzle using RBFS and A* search and manhattan distance heuristic function

sql2000_2005jdbcDriver.jar是使用MyEclipse连接sql数据库时候的驱动程序。-sql2000_2005jdbcDriver.jar is to use MyEclipse to connect sql database when drivers.

一个学员信息管理系统小程序，供大家参考-an information management system for trainees small programs, for your reference

练习643D立体字，643D立体字练习，请使用啊事业-practice 643D three-dimensional characters three-dimensional characters 643D practice, please use ah cause

外文网站上下载的JSP图形编程(3)-foreign-language websites on the JSP download graphics programming (3)

jakarta-tomcat-5