Jsp

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

arcgis geodatabase Access 数据库创建

该程序用以对m序列码的调制在负dB情况下解调的仿真，是对基带信号的调制-procedures for the right sequence code m in the negative dB modulation of the demodulation simulation of the base band signal modulation

toa代码仿真，希望能给大家带来帮助，本人觉得对做定位很有用-toa simulation code, I hope we can help, I do think that the positioning of the useful

一些关于恒流源的资料，那里有电路原理图，用的着的话就拿去吧。-Some information on the constant current source, where the circuit schematic diagram, if used in the case go forward.

VC++6.0实现的游戏俄罗斯方块,速度一般.-VC++ 6.0 realize the game Tetris, speed in general.

一个打砖块的代码，很简单，非常适合出学者-a Dazhuankuai code, which is very simple and very suitable to scholars

camera 驱动源码，用用于支持ov511系列芯片的摄像头，和ov7620系列芯片的摄像头-camera driver source code, with support for the ov511 series chip camera, ov7620 series and the camera chip

资源描述 本设计是基于IAP15F2K60S2的单片机，采用串口通信，应用独立按键和数码管来实现银行排队叫号的模拟情况。 是针对单片机初学者的经典例程，可以让读者认识到单片机的按键 、数码管动态显示、定时器、通信等知识点。

功能 代码功能：输入一页文字，程序可以统计出文字、数字、空格的个数-code