这是关于802.11协议如何让接受，如何发送数据包的一个很精彩.希望对大家有所帮助...

Xilinx Spartan3A Development board

这些是我到目前在PKU上做出的题目，给大家分享一下。-These are what I currently make in the PKU subject to share with you.

flashi原码，网站首页引导上可以应用-flashi original code, Home guidance on the application

C++程序供初学者使用-C program for beginners

一个求大数阶乘的算法，速度不是很快，可以参考。-a majority for the factorial algorithm, the speed is not very high, they can refer to.

如何详细使用力士乐BB-3调试器对工程机械的行走和功能系统进行可靠的调试及修正

AMV转换，是很好用的,哈哈，涨价了乱了解情况-AMV conversion, is a good use, and says that the increase understanding of the situation of chaos

Ole编程，读取Word中表格的文本内容 对于加了宏的Cell内容，暂时没有想到怎么获取。请高手指导 -Ole programming, read the Word in the form of text content for the addition of macro Cell content, there is no thought of how to obtain. Please expert guidance

500多个API函数的详细介绍-over 500 API function details

本算法使用分治法求解最近点对问题。事先用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.