SampleAndroid : the base sample project for android

labwindows 利用I/O读写文件。-LabWindows use I/O read and write documents.

模拟邮箱系统。要输入用户名和密码，直到合格或三次 调用 ggets 可以中途 ESC 退出 返回: 成功:OK 失败:ERROR.可以创建新用户。fw :写信模块 you :发送机名 youfile :对应文件 str1 :信件内容 str :单位字符 w :频率 hc :转换编码,由赫夫曼树获得 strwork1:信件前导信息 strwork2:正式编码-simulated mail system. To enter a user name and password, or until three qualified ggets can call from halfway to the ESC : Success : OK failed : ERROR. You can create new users. Fw : module you write : Send machines were youfile : str1 corresponding documents : letter str : flat characters w : frequency hc : transcoding from the Huffman tree was strwork1 : Information strwork2 letter Spotlight : official coding

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

循环冗余校验的实现

这个是议和功能强大的图书借阅系统 用java实现的可供各大高校使用 -this Parliament is a powerful system to borrow books using java major achievement for the college to use

VB开发的不错的旋转位图程序，可以作为开发者参考使用。谢谢！-VB a good, rotating bitmap procedures, as developers can use and reference. Thank you!

svd气象中用的fortran程序，欢迎大家-svd weather with the fortran program, please take a look at the

小弹球游戏，可以根据选定的快中慢速度来调整小球弹跳的速度-Little pinball game，Small game may be based on the selected fast in the slow speed to adjust the speed of the ball bouncing

平衡二叉树操作的演示 一、 需求分析 （1） 利用平衡二叉树实现动态查找表。实现查找，插入和删除三种基本功能。 （2） 初始，平衡二叉树为空树，操作界面给出查找，插入和删除三种操供选择。每种操作均要提示输入关键字。每次插入和删除一个接点时，显示更新的平衡二叉树。 （3） 重点在于对删除算法的实现。假设要删除的关键字为X的结点，若X不在叶子结点上，则用左子树中的最大值或者右子树中的最小值取代X。如此反复，直到删除动作传递到某个叶子结点，删除叶子结点时，若要进行平衡变换，可采用插入的平衡变换反变换。 -balanced binary tree operation of a demonstration, demand analysis (1) using a balanced binary tree dynamic lookup table. Lookup, insertion and deletion of the three basic functions. (2) The initial, balanced binary tree is empty tree interface gives you insert and delete options for the three parade. Each operation will have to be me to input keywords. Each insert and delete a contact in that update balanced binary tree. (3), the focus is on the deletion algorithm. To remove the assumption that the keyword for the X-Node, if X is not the leaf nodes, Left-used for the highest tree or right-tree to replace the minimum X. So repeatedly, until the deletion of a transfer leaf nodes, delete the leaf nodes, if balancing transform, Ins

基于人工智能方面的，运用极大极小算法的井字棋源代码-Based on artificial intelligence aspects, the use of max-min algorithm source code for tic-tac-toe game