我自己学习用的。不是什么程序，希望能得到大家的帮助。

prototype.js原代码包及详细原代码讲解,迅速让你通过高质量的原代码掌握函数式编程,是js水平提升一个新高度-prototype.js original code and details on the original code, rapidly giving you high-quality original master function-code programming is js upgraded to a new height

c语言学生成绩管理系统， 学生信息录入功能，学生信息浏览功能-c language student performance management system, student information input function, student information browsing, etc.

一个java漂亮外观的源码，支持窗体透明，有兴趣的朋友看看。-Beautiful appearance of a java source code to support transparent form, interested to see friends.

802.11a标准 比较全面 各个方面的都有的-802.11a

gvf snake 范例程式,以matlab撰写-gvf snake sample program to write matlab

这是数据库的教程,是某重点大学的非常专业的讲稿,-This is the Directory database is a key university in a very professional script,

用C实现的硬盘格式化程序-C formatted drives to achieve procedures

利用人工智能程序设计语言prolog编程实现的公式计算软件源代码。-use artificial intelligence programming language prolog programming formula software source code.

文章的浏览以及后台中文章的添加、修改、删除等操作-View the article as well as the background in the article to add, modify, delete and other operations

本算法使用分治法求解最近点对问题。事先用O(nlogn)时间对x坐标进行排序，使得所有的点是按x坐标从小到大排好序的（x坐标相同时y坐标小的排前），然后取下标小于n/2属于左边的点集PL，取下标大于n/2属于右边的点集PR，即用O(1)时间就可以将规模为n的问题分解为两个规模为n/2的、同类型的子问题。分割完毕之后就可以采用分治法，分别求出PL和PR中的最近点对，最终通过递归实现。-This algorithm uses divide and conquer to solve the problem closest point. Prior to use O (nlogn) time to sort the x coordinate so that all points are based on x coordinates from small to large sorted (x coordinates with the same y coordinates of the small, the top), and then remove the standard is less than n/2 the set of points belonging to the left PL, remove the standard is greater than n/2 set of points belonging to the right of PR, that is to use O (1) time can be the problem size n divided into two size n/2, the same type The sub-problems. Segmentation can be used after completion of sub-rule method, respectively, find the PL and PR in the last points and eventually through the recursion.