Acess数据库将被捆绑到领域层形成MapX专题图诉..

通过该程序代码可以快速的进行英语方面的饿搜索 -The adoption of the program code can be quickly carried out the hungry English english

自己开发的动物识别系统，大家使用了就知道了-their development of the animal identification system used by everyone will know the

EPSON 打印机的列表功能 C 语言源代码-EPSON printer features a list of C language source code

应用背景用于大学51单片机课程设计，数码管显示时间，设置闹铃，电子钟，显示时间、日期，秒表用于计时，用于51单片机关键技术AT89S52单片机电子钟（含万年历、闹铃、秒表）有注释，可以删除部分功能，所有功能都采用子函数，采用8位数码管显示，采用8位IO口独立式按键输入。涵盖电子钟所有内容。

删除数组相同元素，并用冒泡法进行排序，最后显示出来。

C程序实现图像信号发生器 -C program implementation procedures for the image signal generator C image signal generator implementation

AJAXMAP,AJAX做的MAP,很好用,DLL控件,-AJAXMAP, AJAX to do the MAP, a very good use, DLL controls,

一个很好用的挂机锁屏幕工具，能有效保护-The hang up with a good lock-screen tools, can effectively protect

这是一个塞马的游戏,请大家多多指教 有些没有完成,希望高手能够帮帮忙-This is a game of Samawah, some of the exhibitions we did not complete, experts hope to help out

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