1.功能完整，直接使用 2、模块独立性强，移植方便，外部仅init和move函数，修改显示和输入即可 3、对减少内存占用、尽量减少屏幕操作进行适当优化...

中日韩点阵字库 Chinese Japanese Korea-China, Japan and South Korea lattice Font Chinese Japanese Korea

裁剪地形图，裁剪地形图后自动完成，自动检查-Cutting topographic maps, topographic maps, after cutting

Data Structure total C++ source code

应用背景钱能编著的《C++程序设计》第二版源代码，不错的学习资源关键技术包括了c++的基本知识，很好的C++入门书籍

一个基于递归下降的四则运算计算器-based on a recursive decline in four Operational Calculator

东南大学C++课件，讲得真的很不错，很适合初学者-Southeast University, C++ software, put it quite true, it is suitable for beginners

DSP算法标准1。可方便自己快速找到所需要的TI算法文档-a DSP algorithm standard. Facilitate their rapid find the necessary documentation TI algorithm

很有用的一份图纸资料 如果各位有类似资料麻烦也上传上来哈-Useful information on a drawing if you have similar trouble also upload information onto Kazakhstan

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

数据结构第一次实验。用来创建线性表和求取线性表的第i个元素。-data structure first experiment. Table used to create linear and linear scale struck the first i elements.