一个关于C，JAVA，ORACALE面试的题目集合

7920驱动程序，采用51 模拟时序方式，8 位并行方式和串行方式。-7920 driver, means the use of 51 analog timing, 8-bit parallel mode and serial mode.

足球机器人比赛仿真平台中实现多个机器人追球的一个实际例子-robot soccer competition simulation platform to implement multiple robots to recover the ball a practical example

基于遗传算法的经济调度处理,word文档有简要说明,并且有算例-Based on genetic algorithms deal with economic dispatch, word document there is a brief description and examples have

GPS高程转换系统，主要实现了GPS的水准拟合。直接把RAR后缀该为EXE即为可执行程序。-GPS Height conversion systems, the main GPS standard fitting. RAR directly to the EXE suffix shall be executable.

常用C 语言 运筹学算法-C-language algorithm tacticians

Arduino 的测试。他们是一个小的例子，我用我测试 arduino 的第一天。也许对你有用。它正在试图控制机器人未来 ！！！

基于matlab仿真的单(双)极性(不)归零码,及其功率谱-based on Matlab simulation single (double) polarity (not) NRZ, and the power spectrum

delphi常用OCX控件,包括delphi编程常用大多数控件-delphi common OCX controls, including the most commonly used controls delphi programming

Win32 API 编写的-prepared by the Win32 API

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