GraphTHello demo examples and other materials

二分法求大整数相乘，快速便捷。很好的源代码，可以用来学习，直接用于工程也是可以的-Dichotomy for large integer multiplication, quickly and easily. Good source code, can be used to study, can be directly used for projects of

Oracel9i在windows下的安装及配置方法-Oracel9i in the windows of the installation and configuration method

AutoCAD画的三维文件，很不错哦，可以下载后自己参照-Three-dimensional AutoCAD drawing files, oh well, you can download their own reference

vc做的一个小游戏。模仿linux下面的一个游戏，消去相同的连通色块，一次消去的越多得分越高，记录保存在注册表中，设置了英雄榜。下次运行的时候，仍然保持了上次的记录。-vc do a little game. Linux imitate following a game, elimination of the same connectivity and replacing an elimination of the more higher scores, records kept in the registry, set up a hero list. The next runs, remains the last record.

最为丰富的图标库，编程必备-most abundant in the icon library, programming required

TMM模拟电磁波在堆膜中传播过程 和场分布,可简易改变参数 作不同体系的透射反射谱图和场分布图-TMM simulation of electromagnetic waves in the spread of membrane reactor process and field distribution can be easy to change the parameters for different systems of transmission reflection spectra and field distribution

通配符匹配程序，详细见注释-wildcard matching procedures, detailed see Notes

天门阵游戏源码。是类似连连看的一款游戏，需要通过鼠标拖动牌到相同牌对齐的地方后，消除。最多有30000局。-days Gate Array game source. 1000 block of Terry Avenue is similar to the one game, through licensing the mouse to drag the same alignment of licensing, eliminate. Up to 30,000 Bureau.

可以聊天传送文件抓取屏幕 ，用VC实现的，解压即可用，功能比较简单-can chat screen crawls transmission of documents, with VC, decompression can be used, relatively simple function

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