jisuanqi

/* 下面这些S11-S44实际上是一个4*4的矩阵，在原始的C实现中是用#define 实现的， 这里把它们实现成为static final是表示了只读，切能在同一个进程空间内的多个 -/* The following S11-S44 is actually a 4* 4 matrix, in the original implementation of C is# Define achievable, where they become static final realize is that the read-only, cut in with a process space more than

java代码统计器，设置你的workspace，即可统计你的所有代码，写了两个版本，一个多线程，一个迭代实现，最后却发现迭代的速度快得多，因此保留了迭代的版本。 此程序仅供娱乐，因为代码量不能说明任何问题-java code for statistical device, set up your workspace, you can statistics all your code, written in two versions, a multi-thread, an iterative implementation, the end, they found that the speed of iteration is much faster, thereby preserving iterative version. This procedure only for entertainment

一个基于Java技术开发的Web邮局，使用户可以通过浏览器访问POP/SMTP服务器，支持多种语言，MIME和虚拟域名！-A Web-based Java technology development of the post office, so that users can browser POP/SMTP server, supports multiple languages, MIME, and virtual domain names!

java编的俄罗斯方块-java series of Rubik"s cube

JAVA MSN机器人主要代码开放 -JAVA MSN robot major open source

java遍历8*8棋盘源代码 运用哈密顿回路遍历，速度很快-java Traversal 8* 8 chessboard source code for the use of ergodic Hamiltonian circuit, fast

文件上传 文件上传 文件上传-uploaduploaduploaduploadupload

java封装好的客户端输入检查 -good java package java client to check the importation of a good package client input check

采鸟一定要看 最基本的-mining must look at the birds most basic Dongdong

实现求解平面最近点对的复杂度为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.