有用的模块

Convolution program in C

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

LED技术攻略，包括LED相关基础知识与驱动电路-LED Technology Strategy, including the relevant basic knowledge and LED driver circuit

源程序是银行综合业务平台中基本业务里的其中几个子业务的c语言的源码--C language codes, which includes some sub services of basic services in bank synthesis service platform

电子元器件绘制系统，可以进行简单的电子器件绘制-Electronic Components rendering system, can be a simple electronic device mapping

最新的电力系统计算的工具包，包括连续潮流、最优潮流计算。-The latest calculation of power system kits, including the continuation power flow, optimal power flow calculation.

system to asosicated of a enterprise how camara comercio

c语言版的学生成绩管理系统，只能在liunx下运行，目前只是在字符界面下的-c language version of student achievement management system that can only be run under liunx is only in the character of

像 ubunto barr 颜色司的变化与进步巴尔的酒吧在节点和多 mure，我发现这分组件时寻求其他人为我的项目。

DSP应用实例(一)--轻松实现BT多点下载 源码-DSP Applications (1) easy to realize multi-point BT download source